Search results for 'Predicate calculus' (try it on Scholar)

1000+ found
Sort by:
  1. Intuitionistic Sentential Calculus (1990). 1. Intuitionistic Sentential Calculus with Iden-Tity. Bulletin of the Section of Logic 19 (3):92-99.score: 120.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. David A. Plaisted (1979). Complete Problems in the First-Order Predicate Calculus. Dept. Of Computer Science, University of Illinois at Urbana-Champaign.score: 75.0
     
    My bibliography  
     
    Export citation  
  3. Sueli Mendes dos Santos (1972). Automatic Proofs for Theorems on Predicate Calculus. [Rio De Janeiro,Pontificia Universidade Católica Do Rio De Janeiro].score: 75.0
     
    My bibliography  
     
    Export citation  
  4. S. Christiaan van Westrhenen (1969). The Statistical Estimation of Provability in the First Order Predicate Calculus. [Eindhoven, Technische Hogeschool (Inslindelaan 2).score: 75.0
    No categories
     
    My bibliography  
     
    Export citation  
  5. Hanoch Ben-Yami (1996). Attributive Adjectives and the Predicate Calculus. Philosophical Studies 83 (3):277 - 289.score: 60.0
    I have attempted to show that many attributive adjectives can be dealt with within the framework of first-order predicate calculus by the method suggested in this paper. I've also supplied independent reasons for the claim that attributive adjectives that are not responsive to this method require a formal treatment different from the one that the adjectives successfully dealt with by that method require. Thus, if the method I've argued for is sound, then the scope of first-order predicate (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. Henk Barendregt, Martin Bunder & Wil Dekkers (1993). Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus. Journal of Symbolic Logic 58 (3):769-788.score: 60.0
    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. The paper considers systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. 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 derivations are not translated. (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  7. S. -Y. Kuroda (1982). Indexed Predicate Calculus. Journal of Semantics 1 (1):43-59.score: 60.0
    A programme to construct an extension of predicate calculus is proposed in which predicates and constants are indexed and interpreted with respect to different (mini-)vorlds reffered to by indices. From another perspective the proposed system is an extension of the idea of indexing noun phrases in syntactic representations in generative grammar. Some applications are given, bx particular, it is applied to the description of ambiguities in intensional contexts, and a comparison is made with a description recently given by (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  8. Mojtaba Aghaei & Mohammad Ardeshir (2003). A Gentzen-Style Axiomatization for Basic Predicate Calculus. Archive for Mathematical Logic 42 (3):245-259.score: 60.0
    We introduce a Gentzen-style sequent calculus axiomatization for Basic Predicate Calculus. Our new axiomatization is an improvement of the previous axiomatizations, in the sense that it has the subformula property. In this system the cut rule is eliminated.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  9. Wil Dekkers, Martin Bunder & Henk Barendregt (1998). Completeness of Two Systems of Illative Combinatory Logic for First-Order Propositional and Predicate Calculus. Archive for Mathematical Logic 37 (5-6):327-341.score: 60.0
    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. The paper considers 4 systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. 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 derivations are not (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  10. Norman D. Megill (1995). A Finitely Axiomatized Formalization of Predicate Calculus with Equality. Notre Dame Journal of Formal Logic 36 (3):435-453.score: 60.0
    We present a formalization of first-order predicate calculus with equality which, unlike traditional systems with axiom schemata or substitution rules, is finitely axiomatized in the sense that each step in a formal proof admits only finitely many choices. This formalization is primarily based on the inference rule of condensed detachment of Meredith. The usual primitive notions of free variable and proper substitution are absent, making it easy to verify proofs in a machine-oriented application. Completeness results are presented. The (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  11. V. A. Bocharov (1983). Subject-Predicate Calculus Free From Existential Import. Studia Logica 42 (2-3):209 - 221.score: 48.0
    Two subject-predicate calculi with equality,SP = and its extensionUSP =, are presented as systems of natural deduction. Both the calculi are systems of free logic. Their presentation is preceded by an intuitive motivation.It is shown that Aristotle's syllogistics without the laws of identitySaP andSiP is definable withinSP =, and that the first-order predicate logic is definable withinUSP =.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  12. Wim Ruitenburg (1998). Basic Predicate Calculus. Notre Dame Journal of Formal Logic 39 (1):18-46.score: 48.0
    We establish a completeness theorem for first-order basic predicate logic BQC, a proper subsystem of intuitionistic predicate logic IQC, using Kripke models with transitive underlying frames. We develop the notion of functional well-formed theory as the right notion of theory over BQC for which strong completeness theorems are possible. We also derive the undecidability of basic arithmetic, the basic logic equivalent of intuitionistic Heyting Arithmetic and classical Peano Arithmetic.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  13. Jesús A. Díaz (1988). Cartesian Analyticity. Southern Journal of Philosophy 26 (1):47-55.score: 45.0
    The syllogism and the predicate calculus cannot account for an ontological argument in Descartes' Fifth Meditation and related texts. Descartes' notion of god relies on the analytic-synthetic distinction, which Descartes had identified before Leibniz and Kant did. I describe how the syllogism and the predicate calculus cannot explain Descartes' ontological argument; then I apply the analytic-synthetic distinction to Descartes’ idea of god.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  14. Jerrold J. Katz (1977). The Advantage of Semantic Theory Over Predicate Calculus In The Representation of Logical Form In Natural Language. The Monist 60 (3):380-405.score: 45.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  15. Christina Schneider (1994). Probability: A New Logico-Semantical Approach. [REVIEW] Journal for General Philosophy of Science 25 (1):107 - 124.score: 45.0
    This approach does not define a probability measure by syntactical structures. It reveals a link between modal logic and mathematical probability theory. This is shown (1) by adding an operator (and two further connectives and constants) to a system of lower predicate calculus and (2) regarding the models of that extended system. These models are models of the modal system S₅ (without the Barcan formula), where a usual probability measure is defined on their set of possible worlds. Mathematical (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  16. Thomas J. McQuade (1994). From Syllogism to Predicate Calculus. Teaching Philosophy 17 (4):293-309.score: 45.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  17. S. Jaśkowski (1969). On the Interpretations of Aristotelian Categorical Propositions in the Predicate Calculus. [REVIEW] Studia Logica 24 (1):161 - 174.score: 45.0
  18. Olgierd Adrian Wojtasiewicz (1978). The Predicate Calculus with Extra-Logical Constants as an Instrument of Semantic Description. Studia Logica 37 (1):103 - 114.score: 45.0
  19. Louise Schmir Hay (1963). Axiomatization of the Infinite-Valued Predicate Calculus. Journal of Symbolic Logic 28 (1):77-86.score: 45.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  20. Richmond H. Thomason & D. Randolph Johnson Jr (1969). Predicate Calculus with Free Quantifier Variables. Journal of Symbolic Logic 34 (1):1-7.score: 45.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  21. August Pieczkowski (1968). Undecidability of the Homogeneous Formulas of Degree 3 of the Predicate Calculus. Studia Logica 22 (1):7 - 16.score: 45.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  22. Paul Weingartner (1973). A Predicate Calculus for Intensional Logic. Journal of Philosophical Logic 2 (2):220 - 303.score: 45.0
  23. Egon Borger (1994). Review: Edsger W. Dijkstra, Carel S. Scholten, Predicate Calculus and Program Semantics. [REVIEW] Journal of Symbolic Logic 59 (2):673-678.score: 45.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  24. Jekeri Okee (1975). A Semantical Proof of the Undecidability of the Monadic Intuitionistic Predicate Calculus of the First Order. Notre Dame Journal of Formal Logic 16 (4):552-554.score: 45.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  25. John H. Harris (1971). Ordinal Theory in a Conservative Extension of Predicate Calculus. Notre Dame Journal of Formal Logic 12 (4):423-428.score: 45.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  26. Leszek Koncewicz (1973). Definability of Classes of Graphs in the First Order Predicate Calculus with Identity. Studia Logica 32 (1):159 - 190.score: 45.0
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  27. Setsuo Saito (1963). Truth Value Assignment in Predicate Calculus of First Order. Notre Dame Journal of Formal Logic 4 (3):216-223.score: 45.0
  28. Richmond H. Thomason (1968). On the Strong Semantical Completeness of the Intuitionistic Predicate Calculus. Journal of Symbolic Logic 33 (1):1-7.score: 45.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  29. Charles G. Morgan (1973). Truth, Falsehood, and Contingency in First-Order Predicate Calculus. Notre Dame Journal of Formal Logic 14 (4):536-542.score: 45.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  30. Shoji Maehara & Gaisi Takeuti (1971). Two Interpolation Theorems for a Π11 Predicate Calculus. Journal of Symbolic Logic 36 (2):262 - 270.score: 45.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  31. Ewa Orłowska (1969). Mechanical Theorem Proving in a Certain Class of Formulae of the Predicate Calculus. Studia Logica 25 (1):17 - 29.score: 45.0
  32. Lars Svenonius (1959). No-Categoricity in First-Order Predicate Calculus. Theoria 25 (2):82-94.score: 45.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  33. L. Borkowski (1961). A Didactical Approach to the Zero-One Decision Procedure of the Expressions of the First Order Monadic Predicate Calculus. Studia Logica 11 (1):76.score: 45.0
  34. Vo A. Lifshits (1969). Normal Form for Deductions in Predicate Calculus with Equality and Functional Symbols. In. In A. O. Slisenko (ed.), Studies in Constructive Mathematics and Mathematical Logic. New York, Consultants Bureau. 21--23.score: 45.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  35. W. A. Pogorzelski & T. Prucnal (1975). Structural Completeness of the First‐Order Predicate Calculus. Mathematical Logic Quarterly 21 (1):315-320.score: 45.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  36. Johannes Bendiek (1952). Review: Stanislaw Jaskowski, On the Interpretations of Aristotelian Categorical Propositions in the Predicate Calculus. [REVIEW] Journal of Symbolic Logic 17 (4):268-268.score: 45.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  37. C. L. Hamblin (1973). A Felicitous Fragment of the Predicate Calculus. Notre Dame Journal of Formal Logic 14 (4):433-447.score: 45.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  38. D. Dragulici & G. Georgescu (2001). Algebraic Logic for Rational Pavelka Predicate Calculus. Mathematical Logic Quarterly 47 (3):315-326.score: 45.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  39. Dov M. Gabbay (1976). Completeness Properties of Heyting's Predicate Calculus with Respect to RE Models. Journal of Symbolic Logic 41 (1):81-94.score: 45.0
  40. Theodore Hailperin (1965). Review: Hubert H. Schneider, Portugatiae Mathematica:Semantics of the Predicate Calculus with Identity and the Validity in the Empty Individual-Domain; Hubert H. Schneider, Portugatiae Mathematica:A Syntactical Characterization of the Predicate Calculus with Identity and the Validity in All Individual-Domains. [REVIEW] Journal of Symbolic Logic 30 (3):385-386.score: 45.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  41. L. Koncewicz (1974). Definability of Classes of Graphs in the First Order Predicate Calculus with Identity. Studia Logica 33 (1):159 - 190.score: 45.0
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  42. Beata Konikowska (1993). Two Over Three: A Two-Valued Logic for Software Specification and Validation Over a Three-Valued Predicate Calculus. Journal of Applied Non-Classical Logics 3 (1):39-71.score: 45.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  43. Georg Kreisel (1970). Review: S. Ju. Maslov, G. E. Minc, V. P. Orevkov, E. Mendelson, Unsolvability in the Constructive Predicate Calculus of Certain Classes of Formulas Containing Only Monadic Predicate Variables. [REVIEW] Journal of Symbolic Logic 35 (1):143-144.score: 45.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  44. F. C. Oglesby (1966). Review: Setsuo Saito, Truth Value Assignment in Predicate Calculus of First Order. [REVIEW] Journal of Symbolic Logic 31 (2):268-268.score: 45.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  45. J. A. Robinson (1996). Gilmore PC. A Program for the Production From Axioms, of Proofs for Theorems Derivable Within the First Order Predicate Calculus. English, with English, French, German, Russian, and Spanish Summaries. Information Processing, Proceedings of the International Conference on Information Processing, Unesco, Paris 15–20 June 1959, Unesco, Paris, R. Oldenbourg, Munich, Butterworths, London, 1960, Pp. 265–273. Porte J., Gilmore PC, Prawitz Dag H., Prawitz Håkon, and Voghera Neri. Discussion. Information ... [REVIEW] Journal of Symbolic Logic 31 (1):124-125.score: 45.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  46. A. Rose (1964). Review: Louise Schmir Hay, Axiomatization of the Infinite-Valued Predicate Calculus. [REVIEW] Journal of Symbolic Logic 29 (2):110-111.score: 45.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  47. Dimiter Skordev (1984). On a Modal-Type Language for the Predicate Calculus. Bulletin of the Section of Logic 13 (3):111-116.score: 45.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  48. M. A. Taitslin (1960). Review: Roger C. Lyndon, An Interpolation Theorem in the Predicate Calculus. [REVIEW] Journal of Symbolic Logic 25 (3):273-274.score: 45.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  49. Toshiharu Waragai (1990). Ontology as a Natural Extension of Predicate Calculus with Identity Equipped with Description. Annals of the Japan Association for Philosophy of Science 7 (5):23-40.score: 45.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  50. Wilhelm Ackermann (1957). Review: A. A. Zykov, The Spectrum Problem in the Extended Predicate Calculus. [REVIEW] Journal of Symbolic Logic 22 (4):360-360.score: 45.0
    Direct download  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000