Results 1  10
of
18
An intuitionistic theory of types
"... An earlier, not yet conclusive, attempt at formulating a theory of this kind was made by Scott 1970. Also related, although less closely, are the type and logic free theories of constructions of Kreisel 1962 and 1965 and Goodman 1970. In its first version, the present theory was based on the strongl ..."
Abstract

Cited by 65 (0 self)
 Add to MetaCart
An earlier, not yet conclusive, attempt at formulating a theory of this kind was made by Scott 1970. Also related, although less closely, are the type and logic free theories of constructions of Kreisel 1962 and 1965 and Goodman 1970. In its first version, the present theory was based on the strongly impredicative axiom that there is a type of all types whatsoever, which is at the same time a type and an object of that type. This axiom had to be abandoned, however, after it was shown to lead to a contradiction by Jean Yves Girard. I am very grateful to him for showing me his paradox. The change that it necessitated is so drastic that my theory no longer contains intuitionistic simple type theory as it originally did. Instead, its proof theoretic strength should be close to that of predicative analysis.
Basic logic: reflection, symmetry, visibility
 Journal of Symbolic Logic
, 1997
"... Abstract We introduce a sequent calculus B for a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic, quantum and nonmodal linear logics, are all obtained as extensions in a uniform way and in a single framework. We isolate t ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
Abstract We introduce a sequent calculus B for a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic, quantum and nonmodal linear logics, are all obtained as extensions in a uniform way and in a single framework. We isolate three properties, which characterize B positively: reflection, symmetry and visibility. A logical constant obeys to the principle of reflection if it is characterized semantically by an equation binding it with a metalinguistic link between assertions, and if its syntactic inference rules are obtained by solving that equation. All connectives of basic logic satisfy reflection. To the control of weakening and contraction of linear logic, basic logic adds a strict control of contexts, by requiring that all active formulae in all rules are isolated, that is visible. From visibility, cutelimination follows. The full, geometric symmetry of basic logic induces known symmetries of its extensions, and adds a symmetry among them, producing the structure of a cube.
Modal Sequent Calculi Labelled with Truth Values: Completeness, Duality and Analyticity
 LOGIC JOURNAL OF THE IGPL
, 2003
"... Labelled sequent calculi are provided for a wide class of normal modal systems using truth values as labels. The rules for formula constructors are common to all modal systems. For each modal system, specific rules for truth values are provided that reflect the envisaged properties of the accessi ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
Labelled sequent calculi are provided for a wide class of normal modal systems using truth values as labels. The rules for formula constructors are common to all modal systems. For each modal system, specific rules for truth values are provided that reflect the envisaged properties of the accessibility relation. Both local and global reasoning are supported. Strong completeness is proved for a natural twosorted algebraic semantics. As a corollary, strong completeness is also obtained over general Kripke semantics. A duality result
Program development by proof transformation
"... We begin by reviewing the natural deduction rules for the!^8fragment of minimal logic. It is shown how intuitionistic and classical logic can be embedded. Recursion and induction is added to obtain a more realistic proof system. Simple types are added in order to make the language more expressive. ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We begin by reviewing the natural deduction rules for the!^8fragment of minimal logic. It is shown how intuitionistic and classical logic can be embedded. Recursion and induction is added to obtain a more realistic proof system. Simple types are added in order to make the language more expressive. We also consider two alternative methods to deal with the strong or constructive existential quantifier 9\Lambda. Finally we discuss the wellknown notion of an extracted program of a derivation involving 9\Lambda, in order to set up a relation between the two alternatives. Section 2 deals with the computational content of classical proofs. As is wellknown a proof of a 89theorem with a quantifierfree kernel where 9 is viewed as defined by:8: can be used as a program. We describe a &quot;direct method &quot; to use such a proof as a program, and compare it with Harvey Friedman's Atranslation [3] followed by program extraction from the resulting constructive proof. It is shown that both algorithms coincide. In section 3 Goad's method of pruning of proof trees is introduced. It is shown how a proof can be simplified after addition of some further assumptions. In a first step some subproofs are replaced by different ones using the additional assumptions. In a second step parts of the proof tree are pruned, i.e. cut out. Note that the first step involves searching for new proofs using the new assumptions of formulas in the proof tree. Hence we also have to discuss proof search in minimal logic. Finally section 4 treats an example already considered by Goad in his thesis [5], the binpacking problem. The main difference to Goad's work is that he used a logic with the strong existential quantifier, whereas we work within the!8fragment. This example is particularly wellsuited to demonstrate that the pruning method can be applied to adapt programs to particular situations, and moreover that pruning can change the functions computed by programs. In this sense this method is essentially different from program development by program transformation. We would like to thank Michael Bopp and KarlHeinz Niggl for their help in preparing these notes.
A Basic Calculus for Verifying Properties of Interacting Objects
"... Abstract We introduce a basic calculus for expressing and proving properties of interacting objects. The objects considered have dynamic behaviour and are organized into object communities in a hierarchical way. After a detailed and formal presentation of the calculus, essential properties of the ca ..."
Abstract
 Add to MetaCart
Abstract We introduce a basic calculus for expressing and proving properties of interacting objects. The objects considered have dynamic behaviour and are organized into object communities in a hierarchical way. After a detailed and formal presentation of the calculus, essential properties of the calculus are discussed, especially the question of compositionality.