scholarly journals Semantic Tableau Versions of Some Normal Modal Systems with Propositional Quantifiers.

Organon F ◽  
2019 ◽  
Vol 26 (3) ◽  
Author(s):  
Daniel Rönnedal
Keyword(s):  
Propositional Quantifiers ◽  
Semantic Tableau ◽  
Modal Systems

scholarly journals Abnormal worlds and the non-Lewis modal systems.

1977 ◽  
Vol 18 (1) ◽  
pp. 95-100
Author(s):  
G. N. Georgacarakos
Keyword(s):  
Modal Systems

An algebraic study of Diodorean modal systems

1965 ◽  
Vol 30 (1) ◽  
pp. 58-64 ◽  
Author(s):  
R. A. Bull
Keyword(s):  
Discrete Time ◽  
Decision Procedure ◽  
John Locke ◽  
Original Model ◽  
Completeness Proof ◽  
Semantic Tableaux ◽  
Algebraic Treatment ◽  
Algebraic Result ◽  
Modal Systems

Attention was directed to modal systems in which ‘necessarily α’ is interpreted as ‘α. is and always will be the case’ by Prior in his John Locke Lectures of 1956. The present paper shows that S4.3, the extension of S4 withALCLpLqLCLqLp,is complete with respect to this interpretation when time is taken to be continuous, and that D, the extension of S4.3 withALNLpLCLCLCpLpLpLp,is complete with respect to this interpretation when time is taken to be discrete. The method employed depends upon the application of an algebraic result of Garrett Birkhoff's to the models for these systems, in the sense of Tarski.A considerable amount of work on S4.3 and D precedes this paper. The original model with discrete time is given in Prior's [7] (p. 23, but note the correction in [8]); that taking time to be continuous yields a weaker system is pointed out by him in [9]. S4.3 and D are studied in [3] of Dummett and Lemmon, where it is shown that D includes S4.3 andCLCLCpLpLpCMLpLp.While in Oxford in 1963, Kripke proved that these were in fact sufficient for D, using semantic tableaux. A decision procedure for S4.3, using Birkhoff's result, is given in my [2]. Dummett conjectured, in a conversation, that taking time to be continuous yielded S4.3. Thus the originality of this paper lies in giving a suitable completeness proof for S4.3, and in the unified algebraic treatment of the systems. It should be emphasised that the credit for first axiomatising D belongs to Kripke.

scholarly journals Higher-Order Illative Combinatory Logic

2013 ◽  
Vol 78 (3) ◽  
pp. 837-872 ◽  
Author(s):  
Łukasz Czajka
Keyword(s):  
Strong Consistency ◽  
Predicate Logic ◽  
Higher Order ◽  
Second Order ◽  
Model Construction ◽  
Partial Answer ◽  
Combinatory Logic ◽  
First Order ◽  
Propositional Quantifiers

AbstractWe show a model construction for a system of higher-order illative combinatory logic thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order intuitionistic predicate logic with second-order propositional quantifiers into the system of Barendregt, Bunder and Dekkers, which gives a partial answer to a question posed by these authors.

On finite and infinite modal systems

1938 ◽  
Vol 3 (2) ◽  
pp. 77-82 ◽  
Author(s):  
C. West Churchman
Keyword(s):  
Modal Logic ◽  
Symbolic Logic ◽  
Modal Operator ◽  
Image Position ◽  
Modal Systems ◽  
Complex Modal

In Oskar Becker's Zur Logik der Modalitäten four systems of modal logic are considered. Two of these are mentioned in Appendix II of Lewis and Langford's Symbolic logic. The first system is based on A1–8 plus the postulate,From A7: ∼◊p⊰∼p we can prove the converse of C11 by writing ∼◊p for p, and hence deriveThe addition of this postulate to A1–8, as Becker points out, allows us to “reduce” all complex modal functions to six, and these six are precisely those which Lewis mentions in his postulates and theorems: p, ∼p, ◊p, ∼◊p, ∼◊∼p, and ◊∼p This reduction is accomplished by showingwhere ◊n means that the modal operator ◊ is repeated n times; e.g., ◊3p = ◊◊◊p. Then it is shown thatBy means of (1), (2), and (3) any complex modal function whatsoever may be reduced to one of the six “simple” modals mentioned above.It might be asked whether this reduction could be carried out still further, i.e., whether two of the six “irreducible” modals could not be equated. But such a reduction would have to be based on the fact that ◊p = p which is inconsistent with the set B1–9 of Lewis and Langford's Symbolic logic and independent of the set A1–8. Hence for neither set would such a reduction be possible.

scholarly journals A note on modal systems.

1963 ◽  
Vol 4 (2) ◽  
pp. 155-157
Author(s):  
Bolesław Sobociński
Keyword(s):  
Modal Systems

scholarly journals On propositional quantifiers in provability logic.

1993 ◽  
Vol 34 (3) ◽  
pp. 401-419 ◽  
Author(s):  
Sergei N. Artemov ◽  
Lev D. Beklemishev
Keyword(s):  
Provability Logic ◽  
Propositional Quantifiers

0249 Further Modal Systems

2017 ◽  
pp. 330-353
Author(s):  
Harry J. Gensler
Keyword(s):  
Modal Systems
Sign in / Sign up

Export Citation Format

Share Document