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

1000+ found
Sort by:
  1. Heinrich Wansing (1995). Tarskian Structured Consequence Relations and Functional Completeness. Mathematical Logic Quarterly 41 (1):73-92.score: 150.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  2. 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.score: 144.0
    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)  
     
    My bibliography  
     
    Export citation  
  3. 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.score: 120.0
    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)  
     
    My bibliography  
     
    Export citation  
  4. 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.score: 120.0
    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)  
     
    My bibliography  
     
    Export citation  
  5. Torben Braüner (2005). Proof-Theoretic Functional Completeness for the Hybrid Logics of Everywhere and Elsewhere. Studia Logica 81 (2):191 - 226.score: 120.0
    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 (5 more)  
     
    My bibliography  
     
    Export citation  
  6. Heinrich Wansing (1993). Functional Completeness for Subsystems of Intuitionistic Propositional Logic. Journal of Philosophical Logic 22 (3):303 - 321.score: 90.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  7. William H. Jobe (1962). Functional Completeness and Canonical Forms in Many-Valued Logics. Journal of Symbolic Logic 27 (4):409-422.score: 90.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  8. S. K. Thomason (1977). Modal Operators and Functional Completeness, II. Journal of Symbolic Logic 42 (3):391-399.score: 90.0
  9. Victor K. Finn (1974). A Criterion of Functional Completeness for \Mathfrakb. Studia Logica 33 (2):121-125.score: 90.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  10. 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.score: 90.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  11. James Rosenberg (1968). Functional Completeness in One Variable. Journal of Symbolic Logic 33 (1):105-106.score: 90.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  12. Ivo Thomas (1960). Functional Completeness of Henkin's Propositional Fragments. Notre Dame Journal of Formal Logic 1 (3):107-110.score: 90.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  13. J. Lambek (1974). Functional Completeness of Cartesian Categories. Annals of Mathematical Logic 6 (3-4):259-292.score: 90.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  14. Alan Rose (1982). A Generalisation of the Concept of Functional Completeness and Applications to Modus Ponens. Mathematical Logic Quarterly 28 (22‐24):317-322.score: 90.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  15. Francis Jeffry Pelletier & Norman M. Martin (1990). Post's Functional Completeness Theorem. Notre Dame Journal of Formal Logic 31 (3):462-475.score: 90.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  16. Dov M. Gabbay (1981). Expressive Functional Completeness in Tense Logic (Preliminary Report). In. In U. Mönnich (ed.), Aspects of Philosophical Logic. Dordrecht. 91--117.score: 90.0
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  17. Herbert E. Hendry (1980). Functional Completeness and Non-Ł Ukasiewiczian Truth Functions. Notre Dame Journal of Formal Logic 21 (3):536-538.score: 90.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  18. Barbara J. Lowesmith & Alan Rose (1984). A Generalisation of Slupecki's Criterion for Functional Completeness. Mathematical Logic Quarterly 30 (9‐11):173-175.score: 90.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  19. Alan Rose (1986). A Relationship Between Ordinary Functional Completeness and a Generalisation of the Concept. Mathematical Logic Quarterly 32 (19‐24):323-330.score: 90.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  20. Yale N. Patt (1977). Independent Necessary Conditions for Functional Completeness in $M$-Valued Logic. Notre Dame Journal of Formal Logic 18 (2):318-320.score: 90.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  21. Sally Barton (1979). The Functional Completeness of Post's M‐Valued Propositional Calculus. Mathematical Logic Quarterly 25 (25‐29):445-446.score: 90.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  22. Kosta Dosen & Zoran Petric (1996). Modal Functional Completeness. In H. Wansing (ed.), Proof Theory of Modal Logic. Kluwer.score: 90.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  23. Andrzej Ehrenfeucht (1955). Review: S. V. Ablonskij, On Functional Completeness in the Three-Valued Calculus. [REVIEW] Journal of Symbolic Logic 20 (2):175-175.score: 90.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  24. Kanzo Hino (1977). On Yablonskii Theory Concerning Functional Completeness of $K$-Valued Logic. Notre Dame Journal of Formal Logic 18 (2):251-254.score: 90.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  25. Hugues Leblanc (1962). Review: Ivo Thomas, Functional Completeness of Henkin's Propositional Fragments. [REVIEW] Journal of Symbolic Logic 27 (1):111-111.score: 90.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  26. 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.score: 90.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  27. Alan Rose (1984). Generalised Functional Completeness of Sets of M‐Valued Sheffer Functions. Mathematical Logic Quarterly 30 (12):177-182.score: 90.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  28. 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.score: 90.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  29. 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.score: 90.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  30. 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.score: 90.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  31. R. Wójcicki (1974). A Note on Week Functional Completeness. Bulletin of the Section of Logic 3 (2):38-40.score: 90.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  32. 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.score: 84.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  33. Leon Henkin (1949). The Completeness of the First-Order Functional Calculus. Journal of Symbolic Logic 14 (3):159-166.score: 72.0
  34. 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.score: 72.0
  35. W. Ackermann (1950). Review: Leon Henkin, The Completeness of the First-Order Functional Calculus. [REVIEW] Journal of Symbolic Logic 15 (1):68-68.score: 72.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  36. 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.score: 72.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  37. 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.score: 72.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  38. Burton Spencer Dreben (1951). Review: J. B. Rosser, A. R. Turquette, Axiom Schemes for M-Valued Functional Calculi of First Order. Part II. Deductive Completeness. [REVIEW] Journal of Symbolic Logic 16 (4):269-269.score: 72.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  39. Leon Henkin (1956). Review: Juliusz Reichbach, Completeness of the Functional Calculus of First Order. [REVIEW] Journal of Symbolic Logic 21 (2):194-194.score: 72.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  40. Alfredo Burrieza Muñiz, Inmaculada Pérez de Guzmán Molina & Emilio J. Muñoz Velasco (2010). Analyzing Completeness of Axiomatic Functional Systems for Temporal × Modal Logics. Mathematical Logic Quarterly 56 (1):89-102.score: 72.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  41. J. Reichbach (1955). Completeness of the Functional Calculus of First Order. Studia Logica 2 (1):245-250.score: 72.0
  42. 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.score: 72.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  43. Perry Smith (1971). Review: Jerzy Slupecki, Witold A. Pogorzelski, A Variant of the Proof of the Completeness of the First Order Functional Calculus. [REVIEW] Journal of Symbolic Logic 36 (4):688-689.score: 72.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  44. William P. Bechtel (1982). Two Common Errors in Explaining Biological and Psychological Phenomena. Philosophy of Science 49 (December):549-574.score: 66.0
    One way in which philosophy of science can perform a valuable normative function for science is by showing characteristic errors made in scientific research programs and proposing ways in which such errors can be avoided or corrected. This paper examines two errors that have commonly plagued research in biology and psychology: 1) functional localization errors that arise when parts of a complex system are assigned functions which these parts are not themselves able to perform, and 2) vacuous functional (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  45. Liu Renren & Lo Czukai (1996). The Maximal Closed Classes of Unary Functions in P‐Valued Logic. Mathematical Logic Quarterly 42 (1):234-240.score: 66.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  46. Kosta Došen (1992). Modal Logic as Metalogic. Journal of Logic, Language and Information 1 (3):173-201.score: 60.0
    The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. In this family one (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  47. Alexander Citkin (2008). A Mind of a Non-Countable Set of Ideas. Logic and Logical Philosophy 17 (1-2):23-39.score: 60.0
    The paper is dedicated to the 80th birthday of the outstanding Russian logician A.V. Kuznetsov. It is addressing a history of the ideas and research conducted by him in non-classical and intermediate logics.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  48. Kensaku Gomi (2009). Theory of Completeness for Logical Spaces. Logica Universalis 3 (2):243-291.score: 54.0
    A logical space is a pair of a non-empty set A and a subset of . Since is identified with {0, 1} A and {0, 1} is a typical lattice, a pair of a non-empty set A and a subset of for a certain lattice is also called a -valued functional logical space. A deduction system on A is a pair (R, D) of a subset D of A and a relation R between A* and A. In terms of (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  49. Kosta Došen (1996). Deductive Completeness. Bulletin of Symbolic Logic 2 (3):243-283.score: 48.0
    This is an exposition of Lambek's strengthening and generalization of the deduction theorem in categories related to intuitionistic propositional logic. Essential notions of category theory are introduced so as to yield a simple reformulation of Lambek's Functional Completeness Theorem, from which its main consequences can be readily drawn. The connections of the theorem with combinatory logic, and with modal and substructural logics, are briefly considered at the end.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  50. Galym Akishev & Robert Goldblatt (2010). Monadic Bounded Algebras. Studia Logica 96 (1):1 - 40.score: 48.0
    We introduce the equational notion of a monadic bounded algebra (MBA), intended to capture algebraic properties of bounded quantification. The variety of all MBA's is shown to be generated by certain algebras of two-valued propositional functions that correspond to models of monadic free logic with an existence predicate. Every MBA is a subdirect product of such functional algebras, a fact that can be seen as an algebraic counterpart to semantic completeness for monadic free logic. The analysis involves the (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000