Results for 'Predicate (Logic) '

1000+ found
Order:
  1. L86, l93, 203,236.Predicate Logic - 2003 - In Jaroslav Peregrin (ed.), Meaning: The Dynamic Turn. Elsevier Science. pp. 12--65.
    No categories
     
    Export citation  
     
    Bookmark  
  2. Kwame Gyekye.Aristotle On Predication - 1976 - International Logic Review 13:102.
    No categories
     
    Export citation  
     
    Bookmark  
  3. Dynamic predicate logic.Jeroen Groenendijk & Martin Stokhof - 1991 - Linguistics and Philosophy 14 (1):39-100.
    This paper is devoted to the formulation and investigation of a dynamic semantic interpretation of the language of first-order predicate logic. The resulting system, which will be referred to as ‘dynamic predicate logic’, is intended as a first step towards a compositional, non-representational theory of discourse semantics. In the last decade, various theories of discourse semantics have emerged within the paradigm of model-theoretic semantics. A common feature of these theories is a tendency to do away with (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   350 citations  
  4.  60
    Predicate Logics of Constructive Arithmetical Theories.Albert Visser - 2006 - Journal of Symbolic Logic 71 (4):1311 - 1326.
    In this paper, we show that the predicate logics of consistent extensions of Heyting's Arithmetic plus Church's Thesis with uniqueness condition are complete $\Pi _{2}^{0}$. Similarly, we show that the predicate logic of HA*, i.e. Heyting's Arithmetic plus the Completeness Principle (for HA*) is complete $\Pi _{2}^{0}$. These results extend the known results due to Valery Plisko. To prove the results we adapt Plisko's method to use Tennenbaum's Theorem to prove 'categoricity of interpretations' under certain assumptions.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5. Wittgensteinian Predicate Logic.Kai F. Wehmeier - 2004 - Notre Dame Journal of Formal Logic 45 (1):1-11.
    We investigate a rst-order predicate logic based on Wittgenstein's suggestion to express identity of object by identity of sign, and difference of objects by difference of signs. Hintikka has shown that predicate logic can indeed be set up in such a way; we show that it can be done nicely. More specically, we provide a perspicuous cut-free sequent calculus, as well as a Hilbert-type calculus, for Wittgensteinian predicate logic and prove soundness and completeness theorems.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  6.  38
    Predicate logics on display.Heinrich Wansing - 1999 - Studia Logica 62 (1):49-75.
    The paper provides a uniform Gentzen-style proof-theoretic framework for various subsystems of classical predicate logic. In particular, predicate logics obtained by adopting van Behthem''s modal perspective on first-order logic are considered. The Gentzen systems for these logics augment Belnap''s display logic by introduction rules for the existential and the universal quantifier. These rules for x and x are analogous to the display introduction rules for the modal operators and and do not themselves allow the Barcan (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  7.  40
    A predicate logical extension of a subintuitionistic propositional logic.Ernst Zimmermann - 2002 - Studia Logica 72 (3):401-410.
    We develop a predicate logical extension of a subintuitionistic propositional logic. Therefore a Hilbert type calculus and a Kripke type model are given. The propositional logic is formulated to axiomatize the idea of strategic weakening of Kripke''s semantic for intuitionistic logic: dropping the semantical condition of heredity or persistence leads to a nonmonotonic model. On the syntactic side this leads to a certain restriction imposed on the deduction theorem. By means of a Henkin argument strong completeness (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  35
    Predicate logics without the structure rules.Yuichi Komori - 1986 - Studia Logica 45 (4):393 - 404.
    In our previous paper [5], we have studied Kripke-type semantics for propositional logics without the contraction rule. In this paper, we will extend our argument to predicate logics without the structure rules. Similarly to the propositional case, we can not carry out Henkin's construction in the predicate case. Besides, there exists a difficulty that the rules of inference () and () are not always valid in our semantics. So, we have to introduce a notion of normal models.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  9.  45
    Predicate Logical Extensions of some Subintuitionistic Logics.Ernst Zimmermann - 2009 - Studia Logica 91 (1):131-138.
    The paper presents predicate logical extensions of some subintuitionistic logics. Subintuitionistic logics result if conditions of the accessibility relation in Kripke models for intuitionistic logic are dropped. The accessibility relation which interprets implication in models for the propositional base subintuitionistic logic considered here is neither persistent on atoms, nor reflexive, nor transitive. Strongly complete predicate logical extensions are modeled with a second accessibility relation, which is a partial order, for the interpretation of the universal quantifier.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  77
    Predicate logic with flexibly binding operators and natural language semantics.Peter Pagin & Dag Westerståhl - 1993 - Journal of Logic, Language and Information 2 (2):89-128.
    A new formalism for predicate logic is introduced, with a non-standard method of binding variables, which allows a compositional formalization of certain anaphoric constructions, including donkey sentences and cross-sentential anaphora. A proof system in natural deduction format is provided, and the formalism is compared with other accounts of this type of anaphora, in particular Dynamic Predicate Logic.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  11.  65
    Classical predicative logic-enriched type theories.Robin Adams & Zhaohui Luo - 2010 - Annals of Pure and Applied Logic 161 (11):1315-1345.
    A logic-enriched type theory is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named and , which we claim correspond closely to the classical predicative systems of second order arithmetic and . We justify this claim by translating each second order system into the corresponding LTT, and proving that these translations are conservative. This is part of an ongoing research project to investigate how LTTs may be used to formalise different (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12.  44
    Elementary Predicate Logic.Wilfrid Hodges, D. Gabbay & F. Guenthner - 1989 - Journal of Symbolic Logic 54 (3):1089-1090.
  13. Random Predicate Logic I: A Probabilistic Approach to Vagueness.William A. Dembski - unknown
    Predicates are supposed to slice reality neatly in two halves, one for which the predicate holds, the other for which it fails. Yet far from being razors, predicates tend to be dull knives that mangle reality. If reality is a tomato and predicates are knives, then when these knives divide the tomato, plenty of mush remains unaccounted for. Of course some knives are sharper than others, just as some predicates are less vague than others. “x is water” is certainly (...)
     
    Export citation  
     
    Bookmark  
  14.  40
    Predicative Logics.Allen Hazen - 1989 - Journal of Symbolic Logic 54 (3):1092-1094.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  15.  7
    Predicate Logic.Howard Pospesel - 1976 - Prentice-Hall.
    This clearly written book makes logic interesting and easier to learn without sacrificing content or rigor. It covers symbolization, proofs, counterexamples, and truth trees. These topics are presented in graded steps, beginning with the symbolization of categorical propositions and concluding with the properties of relations. Logic is applied to materials with which readers will be familiar; both examples and exercises are drawn from newspapers, television, and other popular sources. For individuals intrigued by the formal study of logic.
    Direct download  
     
    Export citation  
     
    Bookmark  
  16. Intermediate predicate logics determined by ordinals.Pierluigi Minari, Mitio Takano & Hiroakira Ono - 1990 - Journal of Symbolic Logic 55 (3):1099-1124.
    For each ordinal $\alpha > 0, L(\alpha)$ is the intermediate predicate logic characterized by the class of all Kripke frames with the poset α and with constant domain. This paper will be devoted to a study of logics of the form L(α). It will be shown that for each uncountable ordinal of the form α + η with a finite or a countable $\eta (> 0)$ , there exists a countable ordinal of the form β + η such (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  44
    Predicative Logic and Formal Arithmetic.John P. Burgess & A. P. Hazen - 1998 - Notre Dame Journal of Formal Logic 39 (1):1-17.
    After a summary of earlier work it is shown that elementary or Kalmar arithmetic can be interpreted within the system of Russell's Principia Mathematica with the axiom of infinity but without the axiom of reducibility.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  18.  29
    Constructive predicate logic with strong negation and model theory.Seiki Akama - 1987 - Notre Dame Journal of Formal Logic 29 (1):18-27.
  19.  30
    Normal predicative logics with graded modalities.Francesco Caro - 1988 - Studia Logica 47 (1):11 - 22.
    In this work we extend results from [4], [3] and [2] about propositional calculi with graded modalities to the predicative level. Our semantic is based on Kripke models with a single domain of interpretation for all the worlds. Therefore the axiomatic system will need a suitable generalization of the Barcan formula. We haven't considered semantics with world-relative domains because they don't present any new difficulties with respect to classical case. Our language will have, as in [1], constant and function symbols, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  20. Dynamic predicate logic.I. I. I. Sem - unknown
    • 1st try: Free variables in PL (Predicate Logic) (1) Jim1 came in. He1 sat down. (antecedent Jim1 … anaphoric he1) |=M, g cm ιx(x = z1  z1 = jim)  sit z1 iff g(z1) ∈ cm & g(z1) = jim & g(z1) ∈ sit.
     
    Export citation  
     
    Bookmark   1 citation  
  21. Predicate Logic in Wittgenstein's Tractatus.D. Marconi - 1995 - Logique Et Analyse 38 (150):179-190.
  22. Individual Concepts in Modal Predicate Logic.Maria Aloni - 2005 - Journal of Philosophical Logic 34 (1):1-64.
    The article deals with the interpretation of propositional attitudes in the framework of modal predicate logic. The first part discusses the classical puzzles arising from the interplay between propositional attitudes, quantifiers and the notion of identity. After comparing different reactions to these puzzles it argues in favor of an analysis in which evaluations of de re attitudes may vary relative to the ways of identifying objects used in the context of use. The second part of the article gives (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   33 citations  
  23.  76
    Contexts in dynamic predicate logic.Albert Visser - 1998 - Journal of Logic, Language and Information 7 (1):21-52.
    In this paper we introduce a notion of context for Groenendijk & Stokhof's Dynamic Predicate Logic DPL. We use these contexts to give a characterization of the relations on assignments that can be generated by composition from tests and random resettings in the case that we are working over an infinite domain. These relations are precisely the ones expressible in DPL if we allow ourselves arbitrary tests as a starting point. We discuss some possible extensions of DPL and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  24.  87
    First order predicate logic with generalized quantifiers.Per Lindström - 1966 - Theoria 32 (3):186--195.
  25. Predicate Logic Without Predicates“.Nicholas Rescher - 1964 - Logique Et Analyse 7:101-103.
     
    Export citation  
     
    Bookmark  
  26.  75
    A predicate logic based on indefinite description and two notions of identity.Robert A. Alps & Robert C. Neveln - 1981 - Notre Dame Journal of Formal Logic 22 (3):251-263.
  27.  32
    Predicate logic and bare particulars.David Oderberg - unknown
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  28. Sequence semantics for dynamic predicate logic.C. F. M. Vermeulen - 1993 - Journal of Logic, Language and Information 2 (3):217-254.
    In this paper a semantics for dynamic predicate logic is developed that uses sequence valued assignments. This semantics is compared with the usual relational semantics for dynamic predicate logic: it is shown that the most important intuitions of the usual semantics are preserved. Then it is shown that the refined semantics reflects out intuitions about information growth. Some other issues in dynamic semantics are formulated and discussed in terms of the new sequence semantics.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  29.  3
    Predicate logic.Matteo Morganti - 2010 - In Jon Williamson & F. Russo (eds.), Key Terms in Logic. pp. 55.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  30. Predicative logic.K. Nishida & J. Tremblay - 1999 - Revue Philosophique De Louvain 97 (1):59-95.
  31.  23
    On finite linear intermediate predicate logics.Hiroakira Ono - 1988 - Studia Logica 47 (4):391 - 399.
    An intermediate predicate logicS + n (n>0) is introduced and investigated. First, a sequent calculusGS n is introduced, which is shown to be equivalent toS + n and for which the cut elimination theorem holds. In § 2, it will be shown thatS + n is characterized by the class of all linear Kripke frames of the heightn.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  32. Predicate Logic (with Anaphora).I. I. I. Sem - unknown
    D2.1 (PL models and assignments) i. A PL model is a pair M = 〈DM, ·M〉 such that (a) DM is a non-empty set, and (b) ·M maps each A ∈ Con to AM ∈ DM, and each B ∈ Prdn to BM  (DM)n. ii. GM = {g| g: Var  DM} is the set of M-assignments. For any g ∈ GM, u ∈ Var, d ∈ DM, g[u/d] := (g\{u, g(u)})  {u, d} is the u-to-d alternative to (...)
     
    Export citation  
     
    Bookmark  
  33.  9
    On Harrop disjunction property in intermediate predicate logics.Katsumasa Ishii - 2023 - Archive for Mathematical Logic 63 (3):317-324.
    A partial solution to Ono’s problem P54 is given. Here Ono’s problem P54 is whether Harrop disjunction property is equivalent to disjunction property or not in intermediate predicate logics. As an application of this result it is shown that some intermediate predicate logics satisfy Harrop disjunction property.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  34.  25
    The Nonarithmeticity of the Predicate Logic of Strictly Primitive Recursive Realizability.Valery Plisko - forthcoming - Review of Symbolic Logic:1-30.
    A notion of strictly primitive recursive realizability is introduced by Damnjanovic in 1994. It is a kind of constructive semantics of the arithmetical sentences using primitive recursive functions. It is of interest to study the corresponding predicate logic. It was argued by Park in 2003 that the predicate logic of strictly primitive recursive realizability is not arithmetical. Park’s argument is essentially based on a claim of Damnjanovic that intuitionistic logic is sound with respect to strictly (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  35.  63
    A translation of intuitionistic predicate logic into basic predicate logic.Mohammad Ardeshir - 1999 - 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.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  36.  26
    Modal Foundations for Predicate Logic.Johan van Benthem - 1997 - Logic Journal of the IGPL 5 (2):259-286.
    The complexity of any logical modeling reflects both the intrinsic structure of a topic described and the weight of the formal tools. Some of this weight seems inherent in even the most basic logical systems. Notably, standard predicate logic is undecidable. In this paper, we investigate ‘lighter’ versions of this general purpose tool, by modally ‘deconstructing’ the usual semantics, and locating implicit choice points in its set up. The first part sets out the interest of this program and (...)
    Direct download  
     
    Export citation  
     
    Bookmark   14 citations  
  37.  49
    On the predicate logics of continuous t-norm BL-algebras.Franco Montagna - 2005 - Archive for Mathematical Logic 44 (1):97-114.
    Abstract.Given a class C of t-norm BL-algebras, one may wonder which is the complexity of the set Taut(C∀) of predicate formulas which are valid in any algebra in C. We first characterize the classes C for which Taut(C∀) is recursively axiomatizable, and we show that this is the case iff C only consists of the Gödel algebra on [0,1]. We then prove that in all cases except from a finite number Taut(C∀) is not even arithmetical. Finally we consider (...) monadic logics TautM(C∀) of classes C of t-norm BL-algebras, and we prove that (possibly with finitely many exceptions) they are undecidable. (shrink)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  38.  18
    Model theory of monadic predicate logic with the infinity quantifier.Facundo Carreiro, Alessandro Facchini, Yde Venema & Fabio Zanasi - 2022 - Archive for Mathematical Logic 61 (3):465-502.
    This paper establishes model-theoretic properties of \, a variation of monadic first-order logic that features the generalised quantifier \. We will also prove analogous versions of these results in the simpler setting of monadic first-order logic with and without equality and \, respectively). For each logic \ we will show the following. We provide syntactically defined fragments of \ characterising four different semantic properties of \-sentences: being monotone and continuous in a given set of monadic predicates; having (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  39.  16
    Arithmetic complexity of the predicate logics of certain complete arithmetic theories.Valery Plisko - 2001 - Annals of Pure and Applied Logic 113 (1-3):243-259.
    It is proved in this paper that the predicate logic of each complete constructive arithmetic theory T having the existential property is Π1T-complete. In this connection, the techniques of a uniform partial truth definition for intuitionistic arithmetic theories is used. The main theorem is applied to the characterization of the predicate logic corresponding to certain variant of the notion of realizable predicate formula. Namely, it is shown that the set of irrefutable predicate formulas is (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  40.  40
    On intermediate predicate logics of some finite Kripke frames, I. levelwise uniform trees.Dmitrij Skvortsov - 2004 - Studia Logica 77 (3):295 - 323.
    An intermediate predicate logic L is called finite iff it is characterized by a finite partially ordered set M, i.e., iff L is the logic of the class of all predicate Kripke frames based on M. In this paper we study axiomatizability of logics of this kind. Namely, we consider logics characterized by finite trees M of a certain type (levelwise uniform trees) and establish the finite axiomatizability criterion for this case.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  41.  67
    Finite Kripke models and predicate logics of provability.Sergei Artemov & Giorgie Dzhaparidze - 1990 - Journal of Symbolic Logic 55 (3):1090-1098.
    The paper proves a predicate version of Solovay's well-known theorem on provability interpretations of modal logic: If a closed modal predicate-logical formula R is not valid in some finite Kripke model, then there exists an arithmetical interpretation f such that $PA \nvdash fR$ . This result implies the arithmetical completeness of arithmetically correct modal predicate logics with the finite model property (including the one-variable fragments of QGL and QS). The proof was obtained by adding "the (...) part" as a specific addition to the standard Solovay construction. (shrink)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  42.  27
    The Cognitive Ontogenesis of Predicate Logic.Pieter A. M. Seuren - 2014 - Notre Dame Journal of Formal Logic 55 (4):499-532.
    Since Aristotle and the Stoa, there has been a clash, worsened by modern predicate logic, between logically defined operator meanings and natural intuitions. Pragmatics has tried to neutralize the clash by an appeal to the Gricean conversational maxims. The present study argues that the pragmatic attempt has been unsuccessful. The “softness” of the Gricean explanation fails to do justice to the robustness of the intuitions concerned, leaving the relation between the principles evoked and the observed facts opaque. Moreover, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  43. Comments on Predicative Logic.Fernando Ferreira - 2006 - Journal of Philosophical Logic 35 (1):1-8.
    We show how to interpret intuitionistic propositional logic into a predicative second-order intuitionistic propositional system having only the conditional and the universal second-order quantifier. We comment on this fact. We argue that it supports the legitimacy of using classical logic in a predicative setting, even though the philosophical cast of predicativism is nonrealistic. We also note that the absence of disjunction and existential quantifications allows one to have a process of normalization of proofs that avoids the use of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  44.  17
    Geach, Aristotle and Predicate Logics.Alex Orenstein - 2015 - Philosophical Investigations 38 (1-2):96-114.
    Geach's account of the Aristotelian logic of categorical sentences supplemented the views shared by Frege, Russell, Quine and others. I argue that this particular predicate logic approach and Geach's points apply to only one variety of natural language categorical sentences. For example, it takes the universal categorical as a universal conditional “If anything is a man, then it is mortal”. A different natural language form can and should be invoked: “Every man is a mortal.” Employing special restricted (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  45.  43
    Coherence in linear predicate logic.Kosta Došen & Zoran Petrić - 2009 - Annals of Pure and Applied Logic 158 (1-2):125-153.
    Coherence with respect to Kelly–Mac Lane graphs is proved for categories that correspond to the multiplicative fragment without constant propositions of classical linear first-order predicate logic without or with mix. To obtain this result, coherence is first established for categories that correspond to the multiplicative conjunction–disjunction fragment with first-order quantifiers of classical linear logic, a fragment lacking negation. These results extend results of [K. Došen, Z. Petrić, Proof-Theoretical Coherence, KCL Publications , London, 2004 ; K. Došen, Z. (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  46.  40
    On the predicate logics of finite Kripke frames.D. Skvortsov - 1995 - Studia Logica 54 (1):79-88.
    In [Ono 1987] H. Ono put the question about axiomatizing the intermediate predicate logicLFin characterized by the class of all finite Kripke frames. It was established in [ Skvortsov 1988] thatLFin is not recursively axiomatizable. One can easily show that for any finite posetM, the predicate logic characterized byM is recursively axiomatizable, and its axiomatization can be constructed effectively fromM. Namely, the set of formulas belonging to this logic is recursively enumerable, since it is embeddable in (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  47.  30
    Semantical analysis of predicate logics without the contraction rule.Hiroakira Ono - 1985 - Studia Logica 44 (2):187 - 196.
    In this paper, a semantics for predicate logics without the contraction rule will be investigated and the completeness theorem will be proved. Moreover, it will be found out that our semantics has a close connection with Beth-type semantics.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  48.  49
    Forcing in łukasiewicz predicate logic.Antonio Di Nola, George Georgescu & Luca Spada - 2008 - Studia Logica 89 (1):111-145.
    In this paper we study the notion of forcing for Łukasiewicz predicate logic (Ł∀, for short), along the lines of Robinson’s forcing in classical model theory. We deal with both finite and infinite forcing. As regard to the former we prove a Generic Model Theorem for Ł∀, while for the latter, we study the generic and existentially complete standard models of Ł∀.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49.  38
    Monadic fuzzy predicate logics.Petr Hájek - 2002 - Studia Logica 71 (2):165-175.
    Two variants of monadic fuzzy predicate logic are analyzed and compared with the full fuzzy predicate logic with respect to finite model property (properties) and arithmetical complexity of sets of tautologies, satisfiable formulas and of analogous notion restricted to finite models.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  50.  35
    The Superintuitionistic Predicate Logic of Finite Kripke Frames Is Not Recursively Axiomatizable.Dmitrij Skvortsov - 2005 - Journal of Symbolic Logic 70 (2):451 - 459.
    We prove that an intermediate predicate logic characterized by a class of finite partially ordered sets is recursively axiomatizable iff it is "finite", i.e., iff it is characterized by a single finite partially ordered set. Therefore, the predicate logic LFin of the class of all predicate Kripke frames with finitely many possible worlds is not recursively axiomatizable.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
1 — 50 / 1000