Anjan Shukla. A set of axioms for the propositional calculus with implication and converse non-implication. Notre Dame journal of formal logic, vol. 6 no. 2 (1965), pp. 123–128.

1966 ◽  
Vol 31 (4) ◽  
pp. 664-664 ◽  
Author(s):  
John Bacon
Keyword(s):  
Propositional Calculus ◽  
Formal Logic

Alternative postulate sets for Lewis's S5

1956 ◽  
Vol 21 (4) ◽  
pp. 347-349
Author(s):  
E. J. Lemmon
Keyword(s):  
Propositional Calculus ◽  
Formal Logic ◽  
Propositional Formula ◽  
Modal Operator ◽  
Special Rules ◽  
Definition Of ◽  
Derived Rules

Professor Prior (Formal logic (1955), pp. 305–307) gives alternative postulate sets for Lewis's S5, one substantially Lewis's own set (p. 305, 6.1) and another, considerably simpler, due to Prior himself (pp. 306–307, 6.5). This note aims at showing that the systems based on these two postulate sets are in fact equivalent. We label the system based on Lewis's postulates ‘S5’, as usual, and that on Prior's postulates ‘P’.The form of the postulate set for P considered here is as follows. We add to the full propositional calculus one definition:Df. M: M = NLN;and two special rules:L1: ⊦Cαβ → ⊦CLαβ;L2: ⊦Cαβ → ⊦CαLβ, if α is fully modalized (a propositional formula is fully modalized, if and only if all occurrences of propositional variables in it lie within the scope of a modal operator).Prior's text (pp. 201–205) indicates sufficiently how it could be shown that any thesis of S5 is a thesis of P and that the rules and definitions of S5 are obtainable as derived rules of P. We turn, therefore, to the problem of showing that any thesis of P is a thesis of S5 and that the rules and definition of P are obtainable as derived rules of S5.

On the quantificational logic of intuitionistic set theory

1986 ◽  
Vol 99 (1) ◽  
pp. 5-10 ◽  
Author(s):  
Harvey M. Friedman ◽  
Andrej Ščedrov
Keyword(s):  
Set Theory ◽  
Propositional Logic ◽  
Propositional Calculus ◽  
Formal Logic ◽  
Predicate Calculus ◽  
Intuitionistic Propositional Calculus ◽  
Quantificational Logic ◽  
Law Of Excluded Middle ◽  
Excluded Middle ◽  
Intuitionistic Set Theory

Formal propositional logic describing the laws of constructive (intuitionistic) reasoning was first proposed in 1930 by Heyting. It is obtained from classical pro-positional calculus by deleting the Law of Excluded Middle, and it is usually referred to as Heyting's (intuitionistic) propositional calculus ([9], §§23, 19) (we write HPP in short). Formal logic involving predicates and quantifiers based on HPP is called Heyting's (intuitionistic) predicate calculus ([9], §§31, 19) (we write HPR in short).

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

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.

¿Razonamos en función de nuestro conocimiento general? Un estudio de las interacciones entre el procesamiento de la información y la inferencia lógica

2015 ◽  
pp. 33
Author(s):  
Miguel López Astorga
Keyword(s):  
Information Processing ◽  
Teaching And Learning ◽  
Learning Processes ◽  
Formal Logic ◽  
Conditional Reasoning ◽  
General Knowledge

RESUMENEn este trabajo, analizamos un experimento sobre el razonamiento condicional de Staller, Sloman y Ben-Zeev (2000). En dicho experimento, los sujetos parecen manifestar un comportamiento contrario a las prescripciones de la lógica formal. Nosotros lo revisamosy descubrimos todas las variables que es preciso atender en los procesos de enseñanza y aprendizaje, variables que no siempre son consideradas por los docentes.Palabras clave: condicional, conocimiento general, inferencia, procesamiento de la información, representación mental.DO WE REASON ACCORDING TO OUR GENERALKNOWLEDGE? A STUDY ABOUT INTERACTIONSBETWEEN INFORMATION PROCESSING AND LOGICALINFERENCEABSTRACTIn this paper, I analyze an experiment about conditional reasoning presented by Staller,Sloman and Ben-Zeev (2000). In that experiment, the subjects’ behavior seems contradictory to prescriptions of formal logic. I check it and I discover all the variables that we need to deal with them in teaching and learning processes, despite that such variables are notalways checked by the teachers.Keywords: conditional, general knowledge, inference, information processing, mentalrepresentation.

Sign in / Sign up

Export Citation Format

Share Document