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

1000+ found
Order:
  1. David A. Plaisted (1979). Complete Problems in the First-Order Predicate Calculus. Dept. Of Computer Science, University of Illinois at Urbana-Champaign.
     
    Export citation  
     
    My bibliography  
  2. Sueli Mendes dos Santos (1972). Automatic Proofs for Theorems on Predicate Calculus. [Rio De Janeiro,Pontificia Universidade Católica Do Rio De Janeiro].
     
    Export citation  
     
    My bibliography  
  3. S. Christiaan van Westrhenen (1969). The Statistical Estimation of Provability in the First Order Predicate Calculus. [Eindhoven, Technische Hogeschool (Inslindelaan 2).
     
    Export citation  
     
    My bibliography  
  4.  81
    Thomas J. McQuade (1994). From Syllogism to Predicate Calculus. Teaching Philosophy 17 (4):293-309.
    The purpose of this paper is to outline an alternative approach to introductory logic courses. Traditional logic courses usually focus on the method of natural deduction or introduce predicate calculus as a system. These approaches complicate the process of learning different techniques for dealing with categorical and hypothetical syllogisms such as alternate notations or alternate forms of analyzing syllogisms. The author's approach takes up observations made by Dijkstrata and assimilates them into a reasoning process based on modified notations. (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  5.  3
    D. Dragulici & G. Georgescu (2001). Algebraic Logic for Rational Pavelka Predicate Calculus. Mathematical Logic Quarterly 47 (3):315-326.
    In this paper we define the polyadic Pavelka algebras as algebraic structures for Rational Pavelka predicate calculus . We prove two representation theorems which are the algebraic counterpart of the completness theorem for RPL∀.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  6.  24
    Intuitionistic Sentential Calculus (1990). 1. Intuitionistic Sentential Calculus with Iden-Tity. Bulletin of the Section of Logic 19 (3):92-99.
    Direct download  
     
    Export citation  
     
    My bibliography  
  7.  18
    Norman D. Megill (1995). A Finitely Axiomatized Formalization of Predicate Calculus with Equality. Notre Dame Journal of Formal Logic 36 (3):435-453.
    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)  
     
    Export citation  
     
    My bibliography  
  8.  14
    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.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  9.  3
    S. -Y. Kuroda (1982). Indexed Predicate Calculus. Journal of Semantics 1 (1):43-59.
    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)  
     
    Export citation  
     
    My bibliography   4 citations  
  10.  27
    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.
    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 (8 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  11.  10
    Mojtaba Aghaei & Mohammad Ardeshir (2003). A Gentzen-Style Axiomatization for Basic Predicate Calculus. Archive for Mathematical Logic 42 (3):245-259.
    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.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  12.  16
    Dimiter Skordev (1984). On a Modal-Type Language for the Predicate Calculus. Bulletin of the Section of Logic 13 (3):111-116.
    In order to avoid the use of individual variables in predicate calculus, several authors proposed language whose expressions can be interpreted, in general, as denotations of predicates . The present author also proposed a language of this kind [5]. The absence of individual variables makes all these languages rather different from the traditional language of predicate calculus and from the usual language of mathematics. The translation procedures from the ordinary predicate languages into the predicate (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  13.  9
    Serge Lapierre & François Lepage (1999). Completeness and Representation Theorem for Epistemic States in First-Order Predicate Calculus. Logica Trianguli 3:85-109.
    The aim of this paper is to present a strongly complete first order functional predicate calculus generalized to models containing not only ordinary classical total functions but also arbitrary partial functions. The completeness proof follows Henkin’s approach, but instead of using maximally consistent sets, we define saturated deductively closed consistent sets . This provides not only a completeness theorem but a representation theorem: any SDCCS defines a canonical model which determine a unique partial value for every predicate (...)
    Direct download  
     
    Export citation  
     
    My bibliography  
  14.  35
    Hanoch Ben-Yami (1996). Attributive Adjectives and the Predicate Calculus. Philosophical Studies 83 (3):277 - 289.
    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)  
     
    Export citation  
     
    My bibliography  
  15.  6
    Wim Ruitenburg (1998). Basic Predicate Calculus. Notre Dame Journal of Formal Logic 39 (1):18-46.
    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)  
     
    Export citation  
     
    My bibliography   5 citations  
  16.  23
    V. A. Bocharov (1983). Subject-Predicate Calculus Free From Existential Import. Studia Logica 42 (2-3):209 - 221.
    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)  
     
    Export citation  
     
    My bibliography  
  17.  30
    Stanisław Jaśkowski (1969). On the Interpretations of Aristotelian Categorical Propositions in the Predicate Calculus. Studia Logica 24 (1):161-172.
  18.  13
    Interdisciplinary Seminar on Peirce (2015). “Betagraphic”: An Alternative Formulation of Predicate Calculus. Transactions of the Charles S. Peirce Society 51 (2):137.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  19. Richard Statman (1978). Bounds for Proof-Search and Speed-Up in the Predicate Calculus. Annals of Mathematical Logic 15 (3):225-287.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   12 citations  
  20.  49
    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.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  21.  14
    Pascal Ostermann (1990). Many-Valued Modal Logics: Uses and Predicate Calculus. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (4):367-376.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  22.  14
    S. C. van Westrhenen (1969). A Probabilistic Machine for the Estimation of Provability in the First Order Predicate Calculus. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 15 (19):291-297.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  23.  8
    Richmond H. Thomason (1968). On the Strong Semantical Completeness of the Intuitionistic Predicate Calculus. Journal of Symbolic Logic 33 (1):1-7.
  24.  19
    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.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  25.  9
    Thomas McLaughlin, Elize Bisanz, Scott R. Cunningham & Clyde Hendrick (2015). "Betagraphic": An Alternative Formulation of Predicate Calculus: Interdisciplinary Seminar on Peirce. Transactions of the Charles S. Peirce Society 51 (2):137-172.
    There are at least a few plausible grounds for our use of the term Beta in our title, notwithstanding that there is a key departure, in our framework, from classical Beta Existential Graphs. The situation, in brief, is as follows.The reader accustomed to Peirce’s graphical development of quantificational logic may, if desired, continue to think of formulas being written on a “sheet of assertion.” We retain the “cut” notation for negation and continue to represent conjunction simply by juxtaposition of diagrams. (...)
    Direct download  
     
    Export citation  
     
    My bibliography  
  26.  29
    Lars Svenonius (1959). No-Categoricity in First-Order Predicate Calculus. Theoria 25 (2):82-94.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  27.  15
    August Pieczkowski (1968). Undecidability of the Homogeneous Formulas of Degree 3 of the Predicate Calculus. Studia Logica 22 (1):7 - 16.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  28.  13
    Louise Schmir Hay (1963). Axiomatization of the Infinite-Valued Predicate Calculus. Journal of Symbolic Logic 28 (1):77-86.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  29.  5
    S. Jaśkowski (1969). On the Interpretations of Aristotelian Categorical Propositions in the Predicate Calculus. Studia Logica 24 (1):173-174.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  30.  3
    Pascal Ostermann (1990). Many‐Valued Modal Logics: Uses and Predicate Calculus. Mathematical Logic Quarterly 36 (4):367-376.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  31.  4
    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.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  32.  1
    S. C. Kleene, W. Craig & R. L. Vaught (1971). Finite Axiomatizability of Theories in the Predicate Calculus Using Additional Predicate Symbols. Journal of Symbolic Logic 36 (2):334-335.
    Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  33.  19
    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.
  34.  14
    Paul Weingartner (1973). A Predicate Calculus for Intensional Logic. Journal of Philosophical Logic 2 (2):220 - 303.
  35.  8
    Joseph D. Rutledge (1960). On the Definition of an Infinitely-Many-Valued Predicate Calculus. Journal of Symbolic Logic 25 (3):212-216.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  36.  4
    W. A. Pogorzelski & T. Prucnal (1975). Structural Completeness of the First‐Order Predicate Calculus. Mathematical Logic Quarterly 21 (1):315-320.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  37.  10
    Egon Borger (1994). Review: Edsger W. Dijkstra, Carel S. Scholten, Predicate Calculus and Program Semantics. [REVIEW] Journal of Symbolic Logic 59 (2):673-678.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  38.  4
    C. L. Hamblin (1973). A Felicitous Fragment of the Predicate Calculus. Notre Dame Journal of Formal Logic 14 (4):433-447.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  39.  1
    Albert Hoogewijs (1983). A Partial Predicate Calculus in a Two-Valued Logic. Mathematical Logic Quarterly 29 (4):239-243.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  40.  9
    Richmond H. Thomason & D. Randolph Johnson Jr (1969). Predicate Calculus with Free Quantifier Variables. Journal of Symbolic Logic 34 (1):1-7.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  41.  22
    Olgierd Adrian Wojtasiewicz (1978). The Predicate Calculus with Extra-Logical Constants as an Instrument of Semantic Description. Studia Logica 37 (1):103 - 114.
  42.  14
    Leszek Koncewicz (1973). Definability of Classes of Graphs in the First Order Predicate Calculus with Identity. Studia Logica 32 (1):159 - 190.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  43.  17
    Ewa Orłowska (1969). Mechanical Theorem Proving in a Certain Class of Formulae of the Predicate Calculus. Studia Logica 25 (1):17 - 29.
  44.  2
    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.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  45.  11
    L. Koncewicz (1974). Definability of Classes of Graphs in the First Order Predicate Calculus with Identity. Studia Logica 33 (1):159 - 190.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  46.  3
    A. B. Slomson (1969). An Undecidable Two Sorted Predicate Calculus. Journal of Symbolic Logic 34 (1):21-23.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  47.  4
    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.
    Direct download  
     
    Export citation  
     
    My bibliography  
  48.  2
    Egon Börger (1994). Dijkstra Edsger W. And Scholten Carel S.. Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. Springer-Verlag, New York, Berlin, Heidelberg, Etc., 1990, Xi+ 220 Pp. [REVIEW] Journal of Symbolic Logic 59 (2):673-678.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  49.  10
    Shoji Maehara & Gaisi Takeuti (1971). Two Interpolation Theorems for a Π11 Predicate Calculus. Journal of Symbolic Logic 36 (2):262 - 270.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  50.  6
    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.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 1000