This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories
Siblings:
141 found
Search inside:
(import / add options)   Sort by:
1 — 50 / 141
  1. M. Abad, J. P. Díaz Varela, L. A. Rueda & A. M. Suardíaz (2000). Varieties of Three-Valued Heyting Algebras with a Quantifier. Studia Logica 65 (2):181-198.
    This paper is devoted to the study of some subvarieties of the variety Qof Q-Heyting algebras, that is, Heyting algebras with a quantifier. In particular, a deeper investigation is carried out in the variety Q 3 of three-valued Q-Heyting algebras to show that the structure of the lattice of subvarieties of Qis far more complicated that the lattice of subvarieties of Heyting algebras. We determine the simple and subdirectly irreducible algebras in Q 3 and we construct the lattice of subvarieties (...)
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  2. Andrew Aberdein & Stephen Read (2009). The Philosophy of Alternative Logics. In Leila Haaparanta (ed.), The Development of Modern Logic. Oxford University Press. 613-723.
    This chapter focuses on alternative logics. It discusses a hierarchy of logical reform. It presents case studies that illustrate particular aspects of the logical revisionism discussed in the chapter. The first case study is of intuitionistic logic. The second case study turns to quantum logic, a system proposed on empirical grounds as a resolution of the antinomies of quantum mechanics. The third case study is concerned with systems of relevance logic, which have been the subject of an especially detailed reform (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. Romà J. Adillon & Ventura Verdú (2000). On a Contraction-Less Intuitionistic Propositional Logic with Conjunction and Fusion. Studia Logica 65 (1):11-30.
    In this paper we prove the equivalence between the Gentzen system G LJ*\c , obtained by deleting the contraction rule from the sequent calculus LJ* (which is a redundant version of LJ), the deductive system IPC*\c and the equational system associated with the variety RL of residuated lattices. This means that the variety RL is the equivalent algebraic semantics for both systems G LJ*\c in the sense of [18] and [4], respectively. The equivalence between G LJ*\c and IPC*\c is a (...)
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  4. Henry Africk (1992). Classical Logic, Intuitionistic Logic, and the Peirce Rule. Notre Dame Journal of Formal Logic 33 (2):229-235.
    A simple method is provided for translating proofs in Grentzen's LK into proofs in Gentzen's LJ with the Peirce rule adjoined. A consequence is a simpler cut elimination operator for LJ + Peirce that is primitive recursive.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  5. Takahito Aoto (1999). Uniqueness of Normal Proofs in Implicational Intuitionistic Logic. Journal of Logic, Language and Information 8 (2):217-242.
    A minimal theorem in a logic L is an L-theorem which is not a non-trivial substitution instance of another L-theorem. Komori (1987) raised the question whether every minimal implicational theorem in intuitionistic logic has a unique normal proof in the natural deduction system NJ. The answer has been known to be partially positive and generally negative. It is shown here that a minimal implicational theorem A in intuitionistic logic has a unique -normal proof in NJ whenever A is provable without (...)
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  6. Hiroshi Aoyama (2004). LK, LJ, Dual Intuitionistic Logic, and Quantum Logic. Notre Dame Journal of Formal Logic 45 (4):193-213.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  7. Mohammad Ardeshir (1999). A Translation of Intuitionistic Predicate Logic Into Basic Predicate Logic. Studia Logica 62 (3):341-352.
    Basic Predicate Logic, BQC, is a proper subsystem of Intuitionistic Predicate Logic, IQC. For every formula in the language {, , , , , , }, we associate two sequences of formulas 0,1,... and 0,1,... in the same language. We prove that for every sequent , there are natural numbers m, n, such that IQC , iff BQC n m. Some applications of this translation are mentioned.
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  8. Mohammad Ardeshir & Mojtaba Moniri (1998). Intuitionistic Open Induction and Least Number Principle and the Buss Operator. Notre Dame Journal of Formal Logic 39 (2):212-220.
    In "Intuitionistic validity in -normal Kripke structures," Buss asked whether every intuitionistic theory is, for some classical theory , that of all -normal Kripke structures for which he gave an r.e. axiomatization. In the language of arithmetic and denote PA plus Open Induction or Open LNP, and are their intuitionistic deductive closures. We show is recursively axiomatizable and , while . If proves PEM but not totality of a classically provably total Diophantine function of , then and so . A (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  9. Sergei Artemov & Rosalie Iemhoff (2007). The Basic Intuitionistic Logic of Proofs. Journal of Symbolic Logic 72 (2):439 - 451.
    The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete axiomatization for the basic logic of proofs in Heyting Arithmetic HA was found.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  10. Sergei Artemov & Tudor Protopopescu (2013). Discovering Knowability: A Semantic Analysis. Synthese 190 (16):3349-3376.
    In this paper, we provide a semantic analysis of the well-known knowability paradox stemming from the Church–Fitch observation that the meaningful knowability principle /all truths are knowable/, when expressed as a bi-modal principle F --> K♢F, yields an unacceptable omniscience property /all truths are known/. We offer an alternative semantic proof of this fact independent of the Church–Fitch argument. This shows that the knowability paradox is not intrinsically related to the Church–Fitch proof, nor to the Moore sentence upon which it (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  11. Jeremy Avigad, Algebraic Proofs of Cut Elimination.
    Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presented, and are used to show how one can sometimes extract a constructive proof and an algorithm from a proof that is nonconstructive. A variation of the double-negation translation is also discussed: if ϕ is provable classically, then ¬(¬ϕ)nf is provable in minimal logic, where θnf denotes the negation-normal form of θ. The translation is used to show that cut-elimination theorems for classical logic can be viewed as special (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  12. Jeremy Avigad (2000). Interpreting Classical Theories in Constructive Ones. Journal of Symbolic Logic 65 (4):1785-1812.
    A number of classical theories are interpreted in analogous theories that are based on intuitionistic logic. The classical theories considered include subsystems of first- and second-order arithmetic, bounded arithmetic, and admissible set theory.
    Remove from this list | Direct download (11 more)  
     
    My bibliography  
     
    Export citation  
  13. Arnon Avron (2005). A Non-Deterministic View on Non-Classical Negations. Studia Logica 80 (2-3):159 - 194.
    We investigate two large families of logics, differing from each other by the treatment of negation. The logics in one of them are obtained from the positive fragment of classical logic (with or without a propositional constant ff for “the false”) by adding various standard Gentzen-type rules for negation. The logics in the other family are similarly obtained from LJ+, the positive fragment of intuitionistic logic (again, with or without ff). For all the systems, we provide simple semantics which is (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  14. S. Awodey & C. Butz (2000). Topological Completeness for Higher-Order Logic. Journal of Symbolic Logic 65 (3):1168-1182.
    Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces- so -called "topological semantics." The first is classical higher-order logic, with relational quantification of finitely high type; the second system is a predicative fragment thereof with quantification over functions between types, but not over arbitrary relations. The second theorem applies to intuitionistic as well as classical logic.
    Remove from this list | Direct download (12 more)  
     
    My bibliography  
     
    Export citation  
  15. Matthias Baaz & Rosalie Iemhoff (2008). On Skolemization in Constructive Theories. Journal of Symbolic Logic 73 (3):969-998.
    In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting of constructive theories. A constructive extension of intuitionistic predicate logic that captures the notions of preorder and existence is introduced and the method, orderization, is shown to be sound and complete with respect to this logic. This implies an analogue of Herbrand's theorem for intuitionistic logic. The orderization method is applied to (...)
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  16. Matthias Baaz & Rosalie Iemhoff (2006). Gentzen Calculi for the Existence Predicate. Studia Logica 82 (1):7 - 23.
    We introduce Gentzen calculi for intuitionistic logic extended with an existence predicate. Such a logic was first introduced by Dana Scott, who provided a proof system for it in Hilbert style. We prove that the Gentzen calculus has cut elimination in so far that all cuts can be restricted to very simple ones. Applications of this logic to Skolemization, truth value logics and linear frames are also discussed.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  17. David Basin, Seán Matthews & Luca Viganò (1998). Natural Deduction for Non-Classical Logics. Studia Logica 60 (1):119-160.
    We present a framework for machine implementation of families of non-classical logics with Kripke-style semantics. We decompose a logic into two interacting parts, each a natural deduction system: a base logic of labelled formulae, and a theory of labels characterizing the properties of the Kripke models. By appropriate combinations we capture both partial and complete fragments of large families of non-classical logics such as modal, relevance, and intuitionistic logics. Our approach is modular and supports uniform proofs of soundness, completeness and (...)
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  18. Michael Beeson (1976). The Unprovability in Intuitionistic Formal Systems of the Continuity of Effective Operations on the Reals. Journal of Symbolic Logic 41 (1):18-24.
  19. W. Russell Belding (1971). Intuitionistic Negation. Notre Dame Journal of Formal Logic 12 (2):183-187.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  20. N. D. Belnap, H. Leblanc & R. H. Thomason (1963). On Not Strengthening Intuitionistic Logic. Notre Dame Journal of Formal Logic 4 (4):313-320.
    tic sequenzen-kalkul of Gentzen, into rules for PCc, the classical sequenzenkalkul. We shall limit ourselves here to sequenzen or turnstile statements of the form A„A„..., A„ I- B, where A„A„..., A„(n ~ 0), and B are wffs consisting of propositional variables, zero or more of the connectives '5', "v', ' ', ')', and '=', and zero or more parentheses. One can pass from PCi to PCc by amending the intelim rules for ' a result of long standing, or by amending (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  21. Johan Van Benthem (2009). The Information in Intuitionistic Logic. Synthese 167 (2):251 - 270.
    Issues about information spring up wherever one scratches the surface of logic. Here is a case that raises delicate issues of 'factual' versus 'procedural' information, or 'statics' versus 'dynamics'. What does intuitionistic logic, perhaps the earliest source of informational and procedural thinking in contemporary logic, really tell us about information? How does its view relate to its 'cousin' epistemic logic? We discuss connections between intuitionistic models and recent protocol models for dynamic-epistemic logic, as well as more general issues that emerge.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  22. G. M. Bierman & V. C. V. de Paiva (2000). On an Intuitionistic Modal Logic. Studia Logica 65 (3):383-416.
    In this paper we consider an intuitionistic variant of the modal logic S4 (which we call IS4). The novelty of this paper is that we place particular importance on the natural deduction formulation of IS4— our formulation has several important metatheoretic properties. In addition, we study models of IS4— not in the framework of Kirpke semantics, but in the more general framework of category theory. This allows not only a more abstract definition of a whole class of models but also (...)
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  23. Jaime Bohórquez V. (2008). Intuitionistic Logic According to Dijkstra's Calculus of Equational Deduction. Notre Dame Journal of Formal Logic 49 (4):361-384.
    Dijkstra and Scholten have proposed a formalization of classical predicate logic on a novel deductive system as an alternative to Hilbert's style of proof and Gentzen's deductive systems. In this context we call it CED (Calculus of Equational Deduction). This deductive method promotes logical equivalence over implication and shows that there are easy ways to prove predicate formulas without the introduction of hypotheses or metamathematical tools such as the deduction theorem. Moreover, syntactic considerations (in Dijkstra's words, "letting the symbols do (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  24. Xavier Caicedo & Roberto Cignoli (2001). An Algebraic Approach to Intuitionistic Connectives. Journal of Symbolic Logic 66 (4):1620-1636.
    It is shown that axiomatic extensions of intuitionistic propositional calculus defining univocally new connectives, including those proposed by Gabbay, are strongly complete with respect to valuations in Heyting algebras with additional operations. In all cases, the double negation of such a connective is equivalent to a formula of intuitionistic calculus. Thus, under the excluded third law it collapses to a classical formula, showing that this condition in Gabbay's definition is redundant. Moreover, such connectives can not be interpreted in all Heyting (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  25. G. Cattaneo, R. Giuntini & S. Pulmannovà (2000). Pre-BZ and Degenerate BZ Posets: Applications to Fuzzy Sets and Unsharp Quantum Theories. [REVIEW] Foundations of Physics 30 (10):1765-1799.
    Two different generalizations of Brouwer–Zadeh posets (BZ posets) are introduced. The former (called pre-BZ poset) arises from topological spaces, whose standard power set orthocomplemented complete atomic lattice can be enriched by another complementation associating with any subset the set theoretical complement of its topological closure. This complementation satisfies only some properties of the algebraic version of an intuitionistic negation, and can be considered as, a generalized form of a Brouwer negation. The latter (called degenerate BZ poset) arises from the so-called (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  26. Alexander Chagrov & Michael Zakharyashchev (1991). The Disjunction Property of Intermediate Propositional Logics. Studia Logica 50 (2):189 - 216.
    This paper is a survey of results concerning the disjunction property, Halldén-completeness, and other related properties of intermediate prepositional logics and normal modal logics containing S4.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  27. Giovanna Corsi & Gabriele Tassi (2007). Intuitionistic Logic Freed of All Metarules. Journal of Symbolic Logic 72 (4):1204 - 1218.
    In this paper we present two calculi for intuitionistic logic. The first one, IG, is characterized by the fact that every proof-search terminates and termination is reached without jeopardizing the subformula property. As to the second one, SIC, proof-search terminates, the subformula property is preserved and moreover proof-search is performed without any recourse to metarules, in particular there is no need to back-track. As a consequence, proof-search in the calculus SIC is accomplished by a single tree as in classical logic.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  28. Bernd I. Dahn (1981). Partial Isomorphisms and Intuitionistic Logic. Studia Logica 40 (4):405 - 413.
    A game for testing the equivalence of Kripke models with respect to finitary and infinitary intuitionistic predicate logic is introduced and applied to discuss a concept of categoricity for intuitionistic theories.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  29. D. Dalen (1986). Glueing of Analysis Models in an Intuitionistic Setting. Studia Logica 45 (2):181 - 186.
    Beth models of analysis are used in model theoretic proofs of the disjunction and (numerical) existence property. By glueing strings of models one obtains a model that combines the properties of the given models. The method asks for a common generalization of Kripke and Beth models. The proof is carried out in intuitionistic analysis plus Markov's Principle. The main new feature is the external use of intuitionistic principles to prove their own preservation under glueing.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  30. H. C. M. de Swart (1977). An Intuitionistically Plausible Interpretation of Intuitionistic Logic. Journal of Symbolic Logic 42 (4):564-578.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  31. Wil Dekkers, Martin Bunder & Henk Barendregt (1998). Completeness of the Propositions-as-Types Interpretation of Intuitionistic Logic Into Illative Combinatory Logic. Journal of Symbolic Logic 63 (3):869-890.
    Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. In a preceding paper, [2], we considered 4 systems of illative combinatory logic that are sound for first order intuitionistic propositional and predicate logic. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators, or in a more direct way, in which (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  32. David DeVidi & Graham Solomon (2001). Knowability and Intuitionistic Logic. Philosophia 28 (1-4):319-334.
    Remove from this list | Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  33. Gustavo Fernández Díez (2000). Five Observations Concerning the Intended Meaning of the Intuitionistic Logical Constants. Journal of Philosophical Logic 29 (4):409-424.
    This paper contains five observations concerning the intended meaning of the intuitionistic logical constants: (1) if the explanations of this meaning are to be based on a non-decidable concept, that concept should not be that of 'proof'; (2) Kreisel's explanations using extra clauses can be significantly simplified; (3) the impredicativity of the definition of → can be easily and safely ameliorated; (4) the definition of → in terms of 'proofs from premises' results in a loss of the inductive character of (...)
    Remove from this list | Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  34. J. Diller & A. S. Troelstra (1984). Realizability and Intuitionistic Logic. Synthese 60 (2):253 - 282.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  35. Adriano Dodó & João Marcos (2014). Negative Modalities, Consistency and Determinedness. Electronic Notes in Theoretical Computer Science 300:21-45.
    We study a modal language for negative operators—an intuitionistic-like negation and its paraconsistent dual—added to (bounded) distributive lattices. For each non-classical negation an extra operator is hereby adjoined in order to allow for standard logical inferences to be opportunely restored. We present abstract characterizations and exhibit the main properties of each kind of negative modality, as well as of the associated connectives that express consistency and determinedness at the object-language level. Appropriate sequent-style proof systems and adequate kripke semantics are also (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  36. Kosta Došen (1981). A Reduction of Classical Propositional Logic to the Conjunction-Negation Fragment of an Intuitionistic Relevant Logic. Journal of Philosophical Logic 10 (4):399 - 408.
  37. Michael Dummett (1998). Truth From the Constructive Standpoint. Theoria 64 (2-3):122-138.
  38. Michael Dummett (1973). The Philosophical Basis of Intuitionistic Logic. In , Truth and Other Enigmas. Duckworth. 215--247.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  39. Michael A. E. Dummett (2000). Elements of Intuitionism. Oxford University Press.
    This is a long-awaited new edition of one of the best known Oxford Logic Guides. The book gives an informal but thorough introduction to intuitionistic mathematics, leading the reader gently through the fundamental mathematical and philosophical concepts. The treatment of various topics has been completely revised for this second edition. Brouwer's proof of the Bar Theorem has been reworked, the account of valuation systems simplified, and the treatment of generalized Beth Trees and the completeness of intuitionistic first-order logic rewritten. Readers (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  40. Michael Dummett & J. N. Crossley (eds.) (1963). Formal Systems and Recursive Functions. North Holland.
    Remove from this list |
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  41. Roy Dyckhoff (1992). Contraction-Free Sequent Calculi for Intuitionistic Logic. Journal of Symbolic Logic 57 (3):795-807.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  42. Roy Dyckhoff & Sara Negri (2000). Admissibility of Structural Rules for Contraction-Free Systems of Intuitionistic Logic. Journal of Symbolic Logic 65 (4):1499-1518.
    We give a direct proof of admissibility of cut and contraction for the contraction-free sequent calculus G4ip for intuitionistic propositional logic and for a corresponding multi-succedent calculus: this proof extends easily in the presence of quantifiers, in contrast to other, indirect, proofs. i.e., those which use induction on sequent weight or appeal to admissibility of rules in other calculi.
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  43. Roy Dyckhoff & Luis Pinto (1998). Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic. Studia Logica 60 (1):107-118.
    We describe a sequent calculus, based on work of Herbelin, of which the cut-free derivations are in 1-1 correspondence with the normal natural deduction proofs of intuitionistic logic. We present a simple proof of Herbelin's strong cut-elimination theorem for the calculus, using the recursive path ordering theorem of Dershowitz.
    Remove from this list | Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  44. Thomas Macaulay Ferguson (2014). Extensions of Priest-da Costa Logic. Studia Logica 102 (1):145-174.
    In this paper, we look at applying the techniques from analyzing superintuitionistic logics to extensions of the cointuitionistic Priest-da Costa logic daC (introduced by Graham Priest as “da Costa logic”). The relationship between the superintuitionistic axioms- definable in daC- and extensions of Priest-da Costa logic (sdc-logics) is analyzed and applied to exploring the gap between the maximal si-logic SmL and classical logic in the class of sdc-logics. A sequence of strengthenings of Priest-da Costa logic is examined and employed to pinpoint (...)
    Remove from this list | Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  45. Thomas Macaulay Ferguson (2014). Łukasiewicz Negation and Many-Valued Extensions of Constructive Logics. In Proc. 44th International Symposium on Multiple-Valued Logic. IEEE Computer Society Press. 121-127.
    This paper examines the relationships between the many-valued logics G~ and Gn~ of Esteva, Godo, Hajek, and Navara, i.e., Godel logic G enriched with Łukasiewicz negation, and neighbors of intuitionistic logic. The popular fragments of Rauszer's Heyting-Brouwer logic HB admit many-valued extensions similar to G which may likewise be enriched with Łukasiewicz negation; the fuzzy extensions of these logics, including HB, are equivalent to G ~, as are their n-valued extensions equivalent to Gn~ for any n ≥ 2. These enriched (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  46. David Fernandez (2006). A Polynomial Translation of S4 Into Intuitionistic Logic. Journal of Symbolic Logic 71 (3):989 - 1001.
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  47. Melvin Fitting, Resolution for Intuitionistic Logic.
    Most automated theorem provers have been built around some version of resolution [4]. But resolution is an inherently Classical logic technique. Attempts to extend the method to other logics have tended to obscure its simplicity. In this paper we present a resolution style theorem prover for Intuitionistic logic that, we believe, retains many of the attractive features of Classical resolution. It is, of course, more complicated, but the complications can be given intuitive motivation. We note that a small change in (...)
    Remove from this list |
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  48. Melvin Fitting (1969). Intuitionistic Logic, Model Theory and Forcing. Amsterdam, North-Holland Pub. Co..
    Remove from this list |
     
    My bibliography  
     
    Export citation  
  49. Jonathan Fleischmann (2010). Syntactic Preservation Theorems for Intuitionistic Predicate Logic. Notre Dame Journal of Formal Logic 51 (2):225-245.
    We define notions of homomorphism, submodel, and sandwich of Kripke models, and we define two syntactic operators analogous to universal and existential closure. Then we prove an intuitionistic analogue of the generalized (dual of the) Lyndon-Łoś-Tarski Theorem, which characterizes the sentences preserved under inverse images of homomorphisms of Kripke models, an intuitionistic analogue of the generalized Łoś-Tarski Theorem, which characterizes the sentences preserved under submodels of Kripke models, and an intuitionistic analogue of the generalized Keisler Sandwich Theorem, which characterizes the (...)
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  50. Josep M. Font (1986). Modality and Possibility in Some Intuitionistic Modal Logics. Notre Dame Journal of Formal Logic 27 (4):533-546.
1 — 50 / 141