9 citations found. Retrieving documents...
K. Godel. An interpretation of the intuitionistic sentential logic. In J. Hintikka, editor, The Philosophy of Mathematics. Oxford University Press, 1969.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Quantified Lax Logic - Fairtlough, Walton (1997)   (2 citations)  (Correct)

....here to be sound and complete in itself, the can be achieved in the following way: T (OE) QLL That is, the equivalence of models and derivability must be proved over the translation. The idea of maps between different logics is not new. Godel first produced a translation [God69] which mapped formulae of the intuitionistic system I onto formulae of the classical modal system S4. It was fairly straightforward to prove that an intuitionistic formula was valid in an I model if and only if the translated formula was valid in an S4 model. Schutte expanded on this work [Sch68] ....

K. Godel. An interpretation of the intuitionistic sentential logic. In J. Hintikka, editor, The Philosophy of Mathematics. Oxford University Press, 1969.


Quantified Lax Logic - Fairtlough, Walton (1997)   (2 citations)  (Correct)

....in the following way: j= QLL OE ( j= S4 0 ,S4 0 ] T (OE) S4 0 ,S4 0 ] T (OE) QLL OE That is, the equivalence of models and derivability must be proved over the translation. The idea of maps between different logics is not new. Godel first produced a translation [God69] which mapped formulae of the intuitionistic system I onto formulae of the classical modal system S4. It was fairly straightforward to prove that an intuitionistic formula was valid in an I model if and only if the translated formula was valid in an S4 model. Schutte expanded on this work [Sch68] ....

K. Godel. An interpretation of the intuitionistic sentential logic. In J. Hintikka, editor, The Philosophy of Mathematics. Oxford University Press, 1969.


Abstraction and Constraints: Two Sides of the Same Coin - Walton (1997)   (1 citation)  (Correct)

....can be abstracted to the pure version by removing all parameters to concurrent agents and replacing if. then. else. statements by non deterministic choice. 2.2 Logic The ability to embed one logic within another logic is well known. Perhaps the most famous embedding was realised by Godel [God69] in which formulae of intuitionistic logic are translated into formulae of modal logic, preserving semantics. The simple propositional case is presented below, where T is the translation function from intuitionistic to modal formulae. The modal box operator 2 is intuitively interpreted as, It ....

K. Godel. An interpretation of the intuitionistic sentential logic. In J. Hintikka, editor, The Philosophy of Mathematics. Oxford University Press, 1969.


Non-Classical Automated Deduction - Bibel, Thielscher (1996)   (1 citation)  (Correct)

....matrix in order to define a suitable variant of the connection method. The approach presented in the remainder of this section follows [32, 33] and is based on the close correspondence between intuitionistic logic and a semantics for modal logic, an observation formally established in [12]. The basic entities of the so called Kripke semantics [21] of modal logics are worlds, each of which has its own collection of truth values for the propositions under consideration. Two worlds, let us denote them by w 0 and w 1 , respectively, might be connected via the relation being in world w ....

Godel, K.: An interpretation of the intuitionistic sentential logic. In: The Philosophy of Mathematics, pp. 128--129. Oxford University Press, 1969.


First-order Lax Logic as a Framework for Constraint.. - Fairtlough, Mendler.. (1997)   (6 citations)  (Correct)

....by two Lax Logic specific rules; Gamma; M fl N fl L Gamma; fl M fl N Gamma M fl R Gamma fl M We write QLL M to denote that the sequent M is derivable in QLL. It is well known that intuitionistic logic can be embedded in the classical modal logic S4, using Godel s translation [God69]. By an extension of this translation, we may embed QLL in a logic we call [S4; S4] S4; S4] has the usual classical logical connectives together with two primitive modalities, i and m , each of which possesses S4 properties. The purpose of multiple modalities is to relate the fundamental ....

K. Godel. An interpretation of the intuitionistic sentential logic. In J. Hintikka, editor, The Philosophy of Mathematics. Oxford University Press, 1969.


First-order Lax Logic as a Framework for Constraint.. - Fairtlough, Mendler.. (1997)   (6 citations)  (Correct)

....in M under assignment ae, written M j= ae M if, for all ff 2 W , M is valid at ff in M under ae ff . A formula M is valid, written j= QLL M , if M is valid in any M for any ae. It is well known that intuitionistic logic can be embedded in the classical modal logic S4, using Godel s translation [God69] By an extension of this translation, we may embed QLL in a classical bi modal logic which we call [S4; S4] This logic has the usual classical logical connectives together with two primitive modalities, i and m , each of which possesses S4 properties. The purpose of multiple modalities is to ....

K. Godel. An interpretation of the intuitionistic sentential logic. In J. Hintikka, editor, The Philosophy of Mathematics. Oxford University Press, 1969.


Intuitionistic Logic with a "Definitely" Operator - Mott (1997)   (Correct)

....logic like Thomason s and ILED is quite complicated to axiomatise. It includes the empirical negation rules and additional ones relating and classical negation. This work has quite a detailed study of persistence. Notes 1 We should also recall here the formal similarity with Godel s famous [5] noting the relation between S4 and Intuitionistic sentence logic referred to three mappings for negation: McKinsey and Tarski [7] showed that each of these preserve theoremhodd in both directions. 2 Rabinowicz [11] briefly considered an operator it is now verified in roughly our sense as a ....

....[11] briefly considered an operator it is now verified in roughly our sense as a model for intuitionistic thruth, but settled instead for it is verifiable because of the logical difficulties the approach leads to. 1 We should also recall here the formal similarity with Godel s famous [5] noting the relation between S4 and Intuitionistic sentence logic referred to three mappings for negation: j or j or j. McKinsey and Tarski [7] showed that each of these preserve theoremhood in both directions. 2 Rabinowicz [11] briefly considered an operator it is now verified in roughly ....

Godel, K. "An Interpretation of the Intuitionistic Sentential Logic," Ergebnisse eines mathematischen Kolloquiums vol 4. Vienna, 1933


Intuitionistic Logic with a "Definitely" Operator - Mott (1997)   (Correct)

....to axiomatise. It includes the empirical negation rules and additional ones relating and classical negation. This work has quite a detailed study of persistence. 22 Notes 1 Williamson [16] is a comprehensive recent study of the Sorites. 2 We should also recall here Godel s famous [5] noting the relation between S4 and Intuitionistic sentence logic referred to three mappings for negation: j or j or j. McKinsey and Tarski [7] showed that each of these preserve theoremhood in both directions. 3 Rabinowicz [11] briefly considered an operator it is now verified in roughly ....

Godel, K. "An Interpretation of the Intuitionistic Sentential Logic," Ergebnisse eines mathematischen Kolloquiums vol 4. Vienna, 1933


A New "Feasible" Arithmetic - Bellantoni, Hofmann (2000)   (Correct)

No context found.

K. Godel, "An Interpretation of the Intuitionistic Sentential Logic", in The Philosophy of Mathematics, J. Hintikka, ed., series Oxford Readings in Philosophy, Oxford University Press, 1969.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC