Search results for 'Functional Completeness' (try it on Scholar)

1000+ found
Order:
  1.  3
    Heinrich Wansing (1995). Tarskian Structured Consequence Relations and Functional Completeness. Mathematical Logic Quarterly 41 (1):73-92.
    In this paper functional completeness results are obtained for certain positive and constructive propositional logics associated with a Tarski-type structured consequence relation as defined by Gabbay.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  2.  3
    Hitoshi Omori & Katsuhiko Sano (2015). Generalizing Functional Completeness in Belnap-Dunn Logic. Studia Logica 103 (5):883-917.
    One of the problems we face in many-valued logic is the difficulty of capturing the intuitive meaning of the connectives introduced through truth tables. At the same time, however, some logics have nice ways to capture the intended meaning of connectives easily, such as four-valued logic studied by Belnap and Dunn. Inspired by Dunn’s discovery, we first describe a mechanical procedure, in expansions of Belnap-Dunn logic, to obtain truth conditions in terms of the behavior of the Truth and the False, (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  3.  20
    C. Caleiro, W. A. Carnielli, M. E. Coniglio, A. Sernadas & C. Sernadas (2003). Fibring Non-Truth-Functional Logics: Completeness Preservation. [REVIEW] Journal of Logic, Language and Information 12 (2):183-211.
    Fibring has been shown to be useful for combining logics endowed withtruth-functional semantics. However, the techniques used so far are unableto cope with fibring of logics endowed with non-truth-functional semanticsas, for example, paraconsistent logics. The first main contribution of thepaper is the development of a suitable abstract notion of logic, that mayalso encompass systems with non-truth-functional connectives, and wherefibring can still be dealt with. Furthermore, it is shown that thisextended notion of fibring preserves completeness under certain (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  4.  12
    I. L. Humberstone (1993). Zero-Place Operations and Functional Completeness, and the Definition of New Connectives. History and Philosophy of Logic 14 (1):39-66.
    Tarski 1968 makes a move in the course of providing an account of ?definitionally equivalent? classes of algebras with a businesslike lack of fanfare and commentary, the significance of which may accordingly be lost on the casual reader. In ?1 we present this move as a response to a certain difficulty in the received account of what it is to define a function symbol (or ?operation symbol?). This difficulty, which presents itself as a minor technicality needing to be got around (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  5.  15
    Torben Braüner (2005). Proof-Theoretic Functional Completeness for the Hybrid Logics of Everywhere and Elsewhere. Studia Logica 81 (2):191 - 226.
    A hybrid logic is obtained by adding to an ordinary modal logic further expressive power in the form of a second sort of propositional symbols called nominals and by adding so-called satisfaction operators. In this paper we consider hybridized versions of S5 (“the logic of everywhere”) and the modal logic of inequality (“the logic of elsewhere”). We give natural deduction systems for the logics and we prove functional completeness results.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  6.  27
    Henri Galinon (2009). A Note on Generalized Functional Completeness in the Realm of Elementrary Logic. Bulletin of the Section of Logic 38 (1):1-9.
    We can think of functional completeness in systems of propositional logic as a form of expressive completeness: while every logical constant in such system expresses a truth-function of finitely many arguments, functional completeness garantees that every truth-function of finitely many arguments can be expressed with the constants in the system. From this point of view, a functionnaly complete system of propositionnal logic can thus be seen as one where no logical constant is missing. Can a (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  7.  1
    Alfredo Burrieza, Inmaculada P. de Guzmán & Emilio Muñoz‐Velasco (2010). Analyzing Completeness of Axiomatic Functional Systems for Temporal × Modal Logics. Mathematical Logic Quarterly 56 (1):89-102.
    In previous works, we presented a modification of the usual possible world semantics by introducing an independent temporal structure in each world and using accessibility functions to represent the relation among them. Different properties ofthe accessibility functions have been considered and axiomatic systems which define these properties have been given. Only a few ofthese systems have been proved tobe complete. The aim ofthis paper is to make a progress in the study ofcompleteness for functional systems. For this end, we (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  8.  5
    Alexej P. Pynko (1999). Functional Completeness and Axiomatizability Within Belnap's Four-Valued Logic and its Expansions. Journal of Applied Non-Classical Logics 9 (1):61-105.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   13 citations  
  9.  14
    Dov M. Gabbay (1981). Expressive Functional Completeness in Tense Logic (Preliminary Report). In U. Mönnich (ed.), Aspects of Philosophical Logic. Dordrecht 91--117.
  10.  6
    J. Lambek (1974). Functional Completeness of Cartesian Categories. Annals of Mathematical Logic 6 (3-4):259-292.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  11.  5
    Sally Barton (1979). The Functional Completeness of Post'sm-Valued Propositional Calculus. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (25-29):445-446.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  12.  16
    Heinrich Wansing (1993). Functional Completeness for Subsystems of Intuitionistic Propositional Logic. Journal of Philosophical Logic 22 (3):303 - 321.
  13.  8
    R. Wójcicki (1974). A Note on Week Functional Completeness. Bulletin of the Section of Logic 3 (2):38-40.
  14.  9
    Francis Jeffry Pelletier & Norman M. Martin (1990). Post's Functional Completeness Theorem. Notre Dame Journal of Formal Logic 31 (3):462-475.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  15.  4
    Barbara J. Lowesmith & Alan Rose (1984). A Generalisation of Slupecki's Criterion for Functional Completeness. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 30 (9-11):173-175.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  16.  4
    Alan Rose (1982). A Generalisation of the Concept of Functional Completeness and Applications to Modus Ponens. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (22-24):317-322.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  17.  4
    Alan Rose (1986). A Relationship Between Ordinary Functional Completeness and a Generalisation of the Concept. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 32 (19-24):323-330.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  18.  4
    Alan Rose (1984). Generalised Functional Completeness of Sets Ofm-Valued Sheffer Functions. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 30 (12):177-182.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  19.  4
    Sally Barton (1979). The Functional Completeness of Post's M‐Valued Propositional Calculus. Mathematical Logic Quarterly 25 (25‐29):445-446.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  20.  1
    Kosta Dosen & Zoran Petric (1996). Modal Functional Completeness. In H. Wansing (ed.), Proof Theory of Modal Logic. Kluwer
  21.  2
    Torben Braüner (2005). Proof-Theoretic Functional Completeness for the Hybrid Logics of Everywhere and Elsewhere. Studia Logica 81 (2):191-226.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  22.  13
    Robert E. Clay (1962). A Simple Proof of Functional Completeness in Many-Valued Logics Based on Ł Ukasiewicz's $C$ and $N$. Notre Dame Journal of Formal Logic 3 (2):114-117.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  23.  6
    Victor K. Finn (1974). A Criterion of Functional Completeness for \Mathfrakb. Studia Logica 33 (2):121-125.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  24.  1
    Herbert E. Hendry (1980). Functional Completeness and Non-Ł Ukasiewiczian Truth Functions. Notre Dame Journal of Formal Logic 21 (3):536-538.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  25.  2
    Kanzo Hino (1977). On Yablonskii Theory Concerning Functional Completeness of $K$-Valued Logic. Notre Dame Journal of Formal Logic 18 (2):251-254.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  26.  10
    S. K. Thomason (1977). Modal Operators and Functional Completeness, II. Journal of Symbolic Logic 42 (3):391-399.
  27.  4
    Barbara J. Lowesmith & Alan Rose (1984). A Generalisation of Slupecki's Criterion for Functional Completeness. Mathematical Logic Quarterly 30 (9‐11):173-175.
  28.  12
    William H. Jobe (1962). Functional Completeness and Canonical Forms in Many-Valued Logics. Journal of Symbolic Logic 27 (4):409-422.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  29.  3
    Alan Rose (1982). A Generalisation of the Concept of Functional Completeness and Applications to Modus Ponens. Mathematical Logic Quarterly 28 (22‐24):317-322.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  30.  7
    James Rosenberg (1968). Functional Completeness in One Variable. Journal of Symbolic Logic 33 (1):105-106.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  31.  5
    Ivo Thomas (1960). Functional Completeness of Henkin's Propositional Fragments. Notre Dame Journal of Formal Logic 1 (3):107-110.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  32.  1
    Hugues Leblanc (1962). Review: Ivo Thomas, Functional Completeness of Henkin's Propositional Fragments. [REVIEW] Journal of Symbolic Logic 27 (1):111-111.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  33.  1
    Ivo Rosenberg & A. Adam (1970). Review: R. V. Frejvald, Funkcional'naá Polnota Dlá Né Vsúdu Oprédélénnyh Funkcij Algébry Logiki (Functional Completeness for Incompletely Specified Logic Functions). [REVIEW] Journal of Symbolic Logic 35 (4):592-593.
    Direct download  
     
    Export citation  
     
    My bibliography  
  34.  1
    Alan Rose (1986). A Relationship Between Ordinary Functional Completeness and a Generalisation of the Concept. Mathematical Logic Quarterly 32 (19‐24):323-330.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  35.  2
    Yale N. Patt (1977). Independent Necessary Conditions for Functional Completeness in $M$-Valued Logic. Notre Dame Journal of Formal Logic 18 (2):318-320.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  36. Andrzej Ehrenfeucht (1955). Review: S. V. Ablonskij, On Functional Completeness in the Three-Valued Calculus. [REVIEW] Journal of Symbolic Logic 20 (2):175-175.
    Direct download  
     
    Export citation  
     
    My bibliography  
  37. Hugues Leblanc (1962). Thomas Ivo. Functional Completeness of Henkin's Prepositional Fragments. Notre Dame Journal of Formal Logic, Vol. 1 , Pp. 107–110. [REVIEW] Journal of Symbolic Logic 27 (1):111.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  38. Alan Rose (1984). Generalised Functional Completeness of Sets of M‐Valued Sheffer Functions. Mathematical Logic Quarterly 30 (12):177-182.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  39. Arto Salomaa (1965). Clay Robert E.. A Simple Proof of Functional Completeness in Many-Valued Logics Based on Łukasiewicz's C and N. Notre Dame Journal of Formal Logic, Vol. 3 , Pp. 114–117.Clay Robert E.. Note on Stupecki T-Functions. [REVIEW] Journal of Symbolic Logic 30 (1):105.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  40. Arto Salomaa (1965). Review: Robert E. Clay, A Simple Proof of Functional Completeness in Many-Valued Logics Based on Lukasiewicz's C and N; Robert E. Clay, Note on Slupecki T-Functions. [REVIEW] Journal of Symbolic Logic 30 (1):105-105.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  41. Arto Salomaa (1964). Review: William H. Jobe, Functional Completeness and Canonical Forms in Many-Valued Logics. [REVIEW] Journal of Symbolic Logic 29 (3):143-144.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  42.  59
    Leon Henkin (1949). The Completeness of the First-Order Functional Calculus. Journal of Symbolic Logic 14 (3):159-166.
  43.  9
    J. Reichbach (1955). Completeness of the Functional Calculus of First Order. Studia Logica 2 (1):245-250.
  44.  6
    J. B. Rosser & A. R. Turquette (1951). Axiom Schemes for M-Valued Functional Calculi of First Order: Part II. Deductive Completeness. Journal of Symbolic Logic 16 (1):22-34.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  45.  4
    W. Ackermann (1950). Review: Leon Henkin, The Completeness of the First-Order Functional Calculus. [REVIEW] Journal of Symbolic Logic 15 (1):68-68.
  46.  6
    Jerzy Słupecki & Witold A. Pogorzeilski (1961). A Variant of the Proof of the Completeness of the First Order Functional Calculus. Studia Logica 12 (1):125 - 134.
  47.  2
    C. Caleiro, W. A. Carnielli & M. E. Coniglio (2003). And C. Sernadas/Fibring Non-Truth-Functional Logics: Completeness Preservation 183–211 Kentaro Kikuchi and Katsumi Sasaki/a Cut-Free Gentzen Formulation of Basic Propositional Calculus 213–225. [REVIEW] Journal of Logic, Language and Information 12:533-535.
    Direct download  
     
    Export citation  
     
    My bibliography  
  48. W. Ackermann (1950). Henkin Leon. The Completeness of the First-Order Functional Calculus. Journal of Symbolic Logic 15 (1):68.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  49. Alonzo Church (1959). Friedberg Richard M., 4-Quantifier Completeness: A Banach-Mazur Functional Not Uniformly Partial Recursive. Bulletin de l'Académie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques Et Physiques, Vol. 6 , Pp. 1–5. [REVIEW] Journal of Symbolic Logic 24 (1):52.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  50. Alonzo Church (1959). Review: Richard M. Friedberg, 4-Quantifier Completeness: A Banach-Mazur Functional Not Uniformly Partial Recursive. [REVIEW] Journal of Symbolic Logic 24 (1):52-52.
     
    Export citation  
     
    My bibliography  
1 — 50 / 1000