Bolesław Sobociński. A note on the regular and irregular modal systems of Lewis. Notre Dame journal of formal logic, vol. 3 (1962), pp. 109–113.

Journal of Symbolic Logic ◽

10.2307/2272580 ◽

1972 ◽

Vol 37 (1) ◽

pp. 181-182

Author(s):

G. F. Schumm

Keyword(s):

Formal Logic ◽

Modal Systems

Download Full-text

Bolesław Sobociński. Remarks about axiomatizations of certain modal systems. Notre Dame journal of formal logic, vol. 5 no. 1 (1964), pp. 71–80. - A. N. Prior, K1, K2 and related modal systems. Notre Dame journal of formal logic, vol. 5 no. 4 (for 1964, pub. 1965), pp. 299–304. - Bolesław Sobociński. Modal system S4.4. Notre Dame journal of formal logic, vol. 5 no. 4 (for 1964, pub. 1965), pp. 305–312. - Bolesław Sobociński. Family of the non-Lewis modal systems. Notre Dame journal of formal logic, vol. 5 no. 4 (for 1964, pub. 1965), pp. 313–318. - Ivo Thomas. A theorem on S4.2 and S4.4. Notre Dame journal of formal logic, vol. 8 no. 4 (for 1967, pub. 1968), pp. 335–336. - Ivo Thomas. Decision for K4. Notre Dame journal of formal logic, vol. 8 no. 4 (for 1967, pub. 1968), pp. 337–338.

Journal of Symbolic Logic ◽

10.2307/2272581 ◽

1972 ◽

Vol 37 (1) ◽

pp. 182-183

Author(s):

G. F. Schumm

Keyword(s):

Formal Logic ◽

Modal System ◽

Modal Systems

Download Full-text

M. J. Cresswell. A Henkin completeness theorem for T. Notre Dame journal of formal logic, vol. 8 no. 3 (for 1967, pub. 1968), pp. 186–190. - M. J. Cresswell. Alternative completeness theorems for modal systems. Notre Dame journal of formal logic, vol. 8 no. 4 (for 1967, pub. 1968), pp. 339–345. - M. J. Cresswell. Some proofs of relative completeness in modal logic. Notre Dame journal of formal logic, vol. 9 no. 1 (1968), pp. 62–66.

Journal of Symbolic Logic ◽

10.2307/2271460 ◽

1970 ◽

Vol 35 (4) ◽

pp. 581-582

Author(s):

David Makinson

Keyword(s):

Modal Logic ◽

Completeness Theorem ◽

Formal Logic ◽

Modal Systems ◽

Completeness Theorems

Download Full-text

Bolesław Sobociński. A contribution to the axiomatization of Lewis' system S5. Notre Dame journal of formal logic, vol. 3 (1962), pp. 51–63. - Bolesław Sobociński. On the generalized Brouwerian axioms.Notre Dame journal of formal logic, vol. 3 (1962), pp. 123–128. - Bolesław Sobociński. A note on modal systems.Notre Dame journal of formal logic, vol. 4 (1963), pp. 155–157. - Ivo Thomas. Solutions of five modal problems of Sobociński.Notre Dame journal of formal logic, vol. 3 (1962), pp. 199–200. - Ivo Thomas. S1° and Brouwerian axioms.Notre Dame journal of formal logic, vol. 4 (1963), pp. 151–152. - Ivo Thomas. S1° and generalized Si-axioms.Notre Dame journal of formal logic, vol. 4 (1963), pp. 153–154. - Ivo Thomas. A final note on S1° and the Brouwerian axioms.Notre Dame journal of formal logic, vol. 4 (1963), pp. 231–232. - Ivo Thomas. Modal systems in the neighbourhood of T.Notre Dame journal of formal logic, vol. 5 no. 1 (1964), pp. 59–61. - Ivo Thomas. Ten modal models. The journal of symbolic logic, vol. 29 no. 3 (1964), pp. 125–128.

Journal of Symbolic Logic ◽

10.2307/2270474 ◽

1966 ◽

Vol 31 (3) ◽

pp. 498-500

Author(s):

Nuel D. Belnap

Keyword(s):

Formal Logic ◽

Symbolic Logic ◽

Final Note ◽

Modal Systems

Download Full-text

A. N. Prior. Notes on a group of new modal systems. Logique et analyse, n.s. vol. 2 (1959), pp. 122–127. - R. A. Bull. An axiomatization of Prior's modal calculus . Notre Dame journal of formal logic, vol. 5 no. 3 (1964), pp. 211–214. - A. N. Prior. Axiomatisations of the modal calculus . Notre Dame journal of formal logic, vol. 5 no. 3 (1964), pp. 215–217.

Journal of Symbolic Logic ◽

10.2307/2270724 ◽

1970 ◽

Vol 35 (3) ◽

pp. 464-464

Author(s):

M. J. Cresswell

Keyword(s):

Formal Logic ◽

Modal Systems

Download Full-text

Bolesław Sobociński. Certain extensions of modal system S4. Notre Dame journal of formal logic, vol. 11 no. 3 (1970), pp. 347–368. - Bolesław Sobociński. Concerning some extensions of S4. Notre Dame journal of formal logic, vol. 12 (1971), pp. 363–370. - G. F. Schumm. Solutions to four modal problems of Sobocinski. Notre Dame journal of formal logic, vol. 12 (1971), pp. 335–340. - J. Jay Zeman. A study of some systems in the neighborhood of S4.4. Notre Dame journal of formal logic, vol. 12 (1971), pp. 341–357. - Bolesław Sobociński. A new class of modal systems. Notre Dame journal of formal logic, vol. 12 (1971), pp. 371–377. - Bolesław Sobociński. A proper subsystem of S4.04. Notre Dame journal of formal logic, vol. 12 (1971), pp. 381–384.

Journal of Symbolic Logic ◽

10.2307/2271811 ◽

1975 ◽

Vol 40 (4) ◽

pp. 602-602

Author(s):

M. J. Cresswell

Keyword(s):

Formal Logic ◽

Modal System ◽

New Class ◽

Modal Systems

Download Full-text

Lennart Åqvist. Results concerning some modal systems that contain S2. The journal of symbolic logic, vol. 29 (1964), pp. 79–87. - E. J. Lemmon. Some results on finite axiomatlzability in modal logic. Notre Dame journal of formal logic, vol. 6 (1965), pp. 301–308. - E. J. Lemmon. A note on Halldén-incompleteness. Notre Dame journal of formal logic, vol. 7 no. 4 (for 1966, pub. 1968), pp. 296–300.

Journal of Symbolic Logic ◽

10.2307/2270868 ◽

1970 ◽

Vol 34 (4) ◽

pp. 648-649

Author(s):

M. J. Cresswell

Keyword(s):

Modal Logic ◽

Formal Logic ◽

Symbolic Logic ◽

Modal Systems

Download Full-text

Anjan Shukla. Decision procedures for Lewis system S1 and related modal systems. Notre Dame journal of formal logic, vol. 11 (1970), pp. 141–180.

Journal of Symbolic Logic ◽

10.2307/2272433 ◽

1972 ◽

Vol 37 (4) ◽

pp. 754-755

Author(s):

R. A. Bull

Keyword(s):

Decision Procedures ◽

Formal Logic ◽

Modal Systems

Download Full-text

Ancient Formal Logic

10.1016/s0049-237x(08)x7080-6 ◽

1951 ◽

Keyword(s):

Formal Logic

Download Full-text

ALGEBRA OF PREDICATES AND RELATED GEOMETRIC MODELS CREATION IN REGARDS OF UNIFIED STATE EXAM IN INFORMATICS (RUSSIAN EGE)

Informatics in school ◽

10.32517/2221-1993-2019-18-3-40-47 ◽

2019 ◽

pp. 40-47

Author(s):

E. A. Mironchik

Keyword(s):

Geometric Model ◽

Main Idea ◽

Formal Logic ◽

High Complexity ◽

Geometric Models ◽

Complexity Problem ◽

Logical Expression ◽

State Examination

The article discusses the method of solving the task 18 on the Unified State Examination in Informatics (Russian EGE). The main idea of the method is to write the conditions of the problem utilizing the language of formal logic, using elementary predicates. According to the laws of logic the resulting complex logical expression would be transformed into an expression, according to which a geometric model is supposed to be constructed which allows to obtain an answer. The described algorithm does allow high complexity problem to be converted into a simple one.

Download Full-text

Concerning "Preliminary Laws and Forms of Correct Thought" — A Query on the Scientific Object of Formal Logic

Chinese Studies in Philosophy ◽

10.2753/csp1097-1467010176 ◽

1969 ◽

Vol 1 (1) ◽

pp. 76-88

Author(s):

Ch'iu Shih

Keyword(s):

Formal Logic ◽

Scientific Object

Download Full-text