On Axiomatizing Free Logic — and Inclusive Logic in the Bargain

Author(s):  
Hugues Leblanc
Keyword(s):  
2017 ◽  
Vol 12 (2) ◽  
Author(s):  
Marilynn Johnson

In An Introduction to Non-Classical Logic: From If to Is Graham Priest (2008) presents branching rules in Free Logic, Variable Domain Modal Logic, and Intuitionist Logic. I propose a simpler, non-branching rule to replace Priest’s rule for universal instantiation in Free Logic, a second, slightly modified version of this rule to replace Priest’s rule for universal instantiation in Variable Domain Modal Logic, and third and fourth rules, further modifying the second rule, to replace Priest’s branching universal and particular instantiation rules in Intuitionist Logic. In each of these logics the proposed rule leads to tableaux with fewer branches. In Intuitionist logic, the proposed rules allow for the resolution of a particular problem Priest grapples with throughout the chapter. In this paper, I demonstrate that the proposed rules can greatly simplify tableaux and argue that they should be used in place of the rules given by Priest.


1992 ◽  
Vol 33 (3) ◽  
pp. 348-358 ◽  
Author(s):  
William C. Purdy
Keyword(s):  

1966 ◽  
Vol 63 (17) ◽  
pp. 481 ◽  
Author(s):  
Bas C. van Fraassen

1954 ◽  
Vol 50 (4) ◽  
pp. 495-512 ◽  
Author(s):  
R. Harrop

This paper contains a summary of some of the results obtained by the author during a study of the propositional part (denoted by A) of a system of free-from-contradiction, type-free logic set up in 1950 by Ackermann (1). It is shown that in its original form the calculus does not possess the desired properties with respect to equivalence of formulae. A calculus A′, which it is shown may be considered as a ‘minimal’ satisfactory extension of A, is constructed. A′ is compared and contrasted with an alternative form A″ of A given by Ackermann in a paper published in 1952 (2). It is proved that A″ is a proper extension of A′. Among the properties of A′ and A″ which are obtained is the resuit that neither calculus possesses a finite complete model. Reference is made to the solution of the decision problem for A, and it is indicated that it is thought that the corresponding problems can probably be solved for A′ and A″. The proofs of many of the results mentioned in the paper are, if given in detail, rather long. In such cases, from space considerations, only outline proofs are given. Complete proofs are contained in (5), which reference also contains several additional properties of the calculi considered.


Sign in / Sign up

Export Citation Format

Share Document