This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories

496 found
Order:
1 — 50 / 496
  1. Second-Order Logic And Foundations Of Mathematics."Anen Jouko V. "A. "An - 2001 - Bulletin of Symbolic Logic 7 (4):504-520.
  2. Conservative Translations.A. Feitosa Hércules & M. Loffredo D'Ottaviano Itala - 2001 - Annals of Pure and Applied Logic 108 (1-3):205-227.
    In this paper we introduce the concept of conservative translation between logics. We present some necessary and sufficient conditions for a translation to be conservative and study some general properties of logical systems, these properties being characterized by the existence of conservative translations between the systems. We prove that the class constituted by logics and conservative translations between them determines a co-complete subcategory of the bi-complete category constituted by logics and translations.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  3. Decision Problems for Tag Systems.Stål Aanderaa & Dag Belsnes - 1971 - Journal of Symbolic Logic 36 (2):229-239.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  4. The Finite Controllability of the Maslov Case.Stål Aanderaa & Warren D. Goldfarb - 1974 - Journal of Symbolic Logic 39 (3):509-518.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  5. Varieties of Three-Valued Heyting Algebras with a Quantifier.M. Abad, Varela J. Díaz, L. Rueda & A. Suardíaz - 2004 - Studia Logica 65 (2):181-198.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  6. On Three-Valued Moisil Algebras.M. Abad & L. Monteiro - 1984 - Logique Et Analyse 27 (8):407-414.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  7. Varieties of Three-Values Heyting Algebras with a Quantifier.Manuel Abad, J. P. Diaz Varela & L. A. Rueda - 2000 - Studia Logica 65 (2):181-198.
    This paper is devoted to the study of some subvarieties of the variety Q of Q-Heyting algebras, that is, Heyting algebras with a quantifier. In particular, a deeper investigation is carried out in the variety Q subscript 3 of three-valued Q-Heyting algebras to show that the structure of the lattice of subvarieties of Q is far more complicated that the lattice of subvarieties of Heyting algebras. We determine the simple and subdirectly irreducible algebras in Q subscript 3 and we construct (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  8. Free Double Ockham Algebras.Manuel Abad & J. Patricio Díaz Varela - 1999 - Journal of Applied Non-Classical Logics 9 (1):173-183.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  9. Systems of Transfinite Types Involving L [Lambda]-Conversion.Abbe Maurice L' - 1953 - Journal of Symbolic Logic 18:209.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  10. On the Independence of Henkin's Axioms for Fragments of the Propositional Calculus.Abbe Maurice L' - 1951 - Journal of Symbolic Logic 16:43.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  11. An Abstraction Algorithm for Combinatory Logic.S. Kamal Abdali - 1976 - Journal of Symbolic Logic 41 (1):222-224.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  12. Curry Algebras Pτ.J. M. Abe - 1998 - Logique Et Analyse 161:5-15.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  13. Annotated Logics Qt and Ultraproducts.Jair Minoro Abe & Seiki Akama - 1997 - Logique Et Analyse 160:335-343.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  14. Weakly Normal Filters and the Closed Unbounded Filter on P Κ Λ.Yoshihiro Abe - 2002 - Bulletin of Symbolic Logic 8 (2):309-311.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  15. Boolean Rings.Alexander Abian - 1977 - Journal of Symbolic Logic 42 (4):588-589.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  16. Rado's Theorem and Solvability of Systems of Equations.Alexander Abian - 1973 - Notre Dame Journal of Formal Logic 14 (2):145-150.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  17. Completeness of the Generalized Propositional Calculus.Alexander Abian - 1970 - Notre Dame Journal of Formal Logic 11 (4):449-452.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  18. Generalized Completeness Theorem and Solvability of Systems of Boolean Polynomial Equations.Alexander Abian - 1970 - Mathematical Logic Quarterly 16 (3):263-264.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  19. The Theory of Sets and Transfinite Arithmetic.Alexander Abian - 1965 - Journal of Symbolic Logic 36 (1):167-167.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  20. On the Solvability of Infinite Systems of Boolean Polynomial Equations.Alexander Abian, Paul D. Bacsich, S. Bulman-Fleming & H. Lakser - 1975 - Journal of Symbolic Logic 40 (1):88-92.
  21. KAT-ML: An Interactive Theorem Prover for Kleene Algebra with Tests.Kamal Aboul-Hosn & Dexter Kozen - 2006 - Journal of Applied Non-Classical Logics 16 (1-2):9-33.
  22. Aronszajn Trees on [Aleph]2 and [Aleph]3.U. Abraham - 1983 - Annals of Pure and Applied Logic 24 (3):213.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography   5 citations  
  23. Some Results in Polychromatic Ramsey Theory.Uri Abraham, James Cummings & Clifford Smyth - 2007 - Journal of Symbolic Logic 72 (3):865 - 896.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  24. Coalgebras, Chu Spaces, and Representations of Physical Systems.Samson Abramsky - 2013 - Journal of Philosophical Logic 42 (3):551-574.
    We investigate the use of coalgebra to represent quantum systems, thus providing a basis for the use of coalgebraic methods in quantum information and computation. Coalgebras allow the dynamics of repeated measurement to be captured, and provide mathematical tools such as final coalgebras, bisimulation and coalgebraic logic. However, the standard coalgebraic framework does not accommodate contravariance, and is too rigid to allow physical symmetries to be represented. We introduce a fibrational structure on coalgebras in which contravariance is represented by indexing. (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  25. A Geometrical Representation of the Basic Laws of Categorial Grammar.Abrusci V. Michele & Casadio Claudia - 2017 - Studia Logica 105 (3):479-520.
    We present a geometrical analysis of the principles that lay at the basis of Categorial Grammar and of the Lambek Calculus. In Abrusci it is shown that the basic properties known as Residuation laws can be characterized in the framework of Cyclic Multiplicative Linear Logic, a purely non-commutative fragment of Linear Logic. We present a summary of this result and, pursuing this line of investigation, we analyze a well-known set of categorial grammar laws: Monotonicity, Application, Expansion, Type-raising, Composition, Geach laws (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  26. Generalization of Scott's Formula for Retractions From Generalized Alexandroff's Cube.Jarosław Achinger - 1986 - Studia Logica 45 (3):281 - 292.
    In the paper [2] the following theorem is shown: Theorem (Th. 3,5, [2]), If =0 or = or , then a closure space X is an absolute extensor for the category of , -closure spaces iff a contraction of X is the closure space of all , -filters in an , -semidistributive lattice.In the case when = and =, this theorem becomes Scott's theorem.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  27. On Decidable Consequence Operators.Jarosław Achinger & Andrzej W. Jankowski - 1986 - Studia Logica 45 (4):415 - 424.
    The main theorem says that a consequence operator is an effective part of the consequence operator for the classical prepositional calculus iff it is a consequence operator for a logic satisfying the compactness theorem, and in which every finitely axiomatizable theory is decidable.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  28. Vaught’s Conjecture Without Equality.Nathanael Leedom Ackerman - 2015 - Notre Dame Journal of Formal Logic 56 (4):573-582.
    Suppose that $\sigma\in{\mathcal{L}}_{\omega _{1},\omega }$ is such that all equations occurring in $\sigma$ are positive, have the same set of variables on each side of the equality symbol, and have at least one function symbol on each side of the equality symbol. We show that $\sigma$ satisfies Vaught’s conjecture. In particular, this proves Vaught’s conjecture for sentences of $ {\mathcal{L}}_{\omega _{1},\omega }$ without equality.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  29. On Transferring Model Theoretic Theorems of $${\Mathcal{L}_{{\Infty},\Omega}}$$ L ∞, Ω in the Category of Sets to a Fixed Grothendieck Topos.Nathanael Leedom Ackerman - 2014 - Logica Universalis 8 (3-4):345-391.
    Working in a fixed Grothendieck topos Sh(C, J C ) we generalize \({\mathcal{L}_{{\infty},\omega}}\) to allow our languages and formulas to make explicit reference to Sh(C, J C ). We likewise generalize the notion of model. We then show how to encode these generalized structures by models of a related sentence of \({\mathcal{L}_{{\infty},\omega}}\) in the category of sets and functions. Using this encoding we prove analogs of several results concerning \({\mathcal{L}_{{\infty},\omega}}\) , such as the downward Löwenheim–Skolem theorem, the completeness theorem and (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  30. Solvable Cases of the Decision Problem.W. Ackermann - 1957 - Journal of Symbolic Logic 22 (1):68-72.
    Remove from this list   Direct download  
     
    Export citation  
     
    My bibliography  
  31. Matrix Satisfiability and Axiomatization.Robert Ackermann - 1971 - Notre Dame Journal of Formal Logic 12 (3):309-321.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  32. Review: Toshio Umezawa, On Intermediate Propositional Logics. [REVIEW]W. Ackermann - 1960 - Journal of Symbolic Logic 25 (2):180-180.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  33. Mostowski Andrzej. Concerning a Problem of H. Scholz. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Bd. 2 , S. 210–214. [REVIEW]W. Ackermann - 1959 - Journal of Symbolic Logic 24 (3):241.
    Remove from this list  
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  34. Review: Andrzej Mostowski, Concerning a Problem of H. Scholz. [REVIEW]W. Ackermann - 1959 - Journal of Symbolic Logic 24 (3):241-241.
    Remove from this list  
     
    Export citation  
     
    My bibliography  
  35. Jaśkowski S. Undecidability of First Order Sentences in the Theory of Free Groupoids. Fundamenta Mathematicae, Bd. 43 , S. 36–45. [REVIEW]W. Ackermann - 1958 - Journal of Symbolic Logic 23 (4):445.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  36. Schütte Kurt. Zur Widerspruchsfreiheit einer typenfreien Logik. Mathematische Annalen, Bd. 125 Heft 4 , S. 394–400.W. Ackermann - 1955 - Journal of Symbolic Logic 20 (1):67.
    Remove from this list  
    Translate
      Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  37. Henkin Leon. The Completeness of the First-Order Functional Calculus.W. Ackermann - 1950 - Journal of Symbolic Logic 15 (1):68.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  38. Mostowski Andrzej. On the Principle of Dependent Choices. Fundamenta Mathematicae Bd. 35 , S. 127–130.W. Ackermann - 1950 - Journal of Symbolic Logic 14 (4):257.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  39. Fitch Frederic B. On Natural Numbers, Integers, and Rationals.W. Ackermann - 1950 - Journal of Symbolic Logic 14 (4):258.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  40. Binary Refinement Implies Discrete Exponentiation.Peter Aczel, Laura Crosilla, Hajime Ishihara, Erik Palmgren & Peter Schuster - 2006 - Studia Logica 84 (3):361-368.
    Working in the weakening of constructive Zermelo-Fraenkel set theory in which the subset collection scheme is omitted, we show that the binary refinement principle implies all the instances of the exponentiation axiom in which the basis is a discrete set. In particular binary refinement implies that the class of detachable subsets of a set form a set. Binary refinement was originally extracted from the fullness axiom, an equivalent of subset collection, as a principle that was sufficient to prove that the (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  41. Consequence Operations Based on Hypergraph Satisfiability.Adam Kolany - 1997 - Studia Logica 58 (2):261-272.
    Four consequence operators based on hypergraph satisfiability are defined. Their properties are explored and interconnections are displayed. Finally their relation to the case of the Classical Propositional Calculus is shown.
    Remove from this list   Direct download (8 more)  
     
    Export citation  
     
    My bibliography  
  42. On Quasivarieties and Varieties as Categories.Jiří Adámek - 2004 - Studia Logica 78 (1-2):7 - 33.
    Finitary quasivarieties are characterized categorically by the existence of colimits and of an abstractly finite, regularly projective regular generator G. Analogously, infinitary quasivarieties are characterized: one drops the assumption that G be abstractly finite. For (finitary) varieties the characterization is similar: the regular generator is assumed to be exactly projective, i.e., hom(G, –) is an exact functor. These results sharpen the classical characterization theorems of Lawvere, Isbell and other authors.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  43. On the Logic of Continuous Algebras.Jiří Adámek, Alan H. Mekler, Evelyn Nelson & Jan Reiterman - 1988 - Notre Dame Journal of Formal Logic 29 (3):365-380.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  44. On Maximal Theories.Zofia Adamowicz - 1991 - Journal of Symbolic Logic 56 (3):885-890.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  45. Open Induction and the True Theory of Rationals.Zofia Adamowicz - 1987 - Journal of Symbolic Logic 52 (3):793-801.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  46. A Recursive Model for Arithmetic with Weak Induction.Zofia Adamowicz & Guillermo Morales-Luna - 1985 - Journal of Symbolic Logic 50 (1):49-54.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  47. A Game-Based Formal System for Ł∞.Alan Adamson & Robin Giles - 1979 - Studia Logica 38 (1):49-73.
    A formal system for , based on a game-theoretic analysis of the ukasiewicz prepositional connectives, is defined and proved to be complete. An Herbrand theorem for the predicate calculus (a variant of some work of Mostowski) and some corollaries relating to its axiomatizability are proved. The predicate calculus with equality is also considered.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  48. Thorn-Forking as Local Forking.Hans Adler - 2009 - Journal of Mathematical Logic 9 (1):21-38.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  49. A Geometric Introduction to Forking and Thorn-Forking.Hans Adler - 2009 - Journal of Mathematical Logic 9 (1):1-20.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    My bibliography   15 citations  
  50. Gentzen-Style Axiomatizations for Some Conservative Extensions of Basic Propositional Logic.Mojtaba Aghaei & Mohammad Ardeshir - 2001 - Studia Logica 68 (2):263-285.
    We introduce two Gentzen-style sequent calculus axiomatizations for conservative extensions of basic propositional logic. Our first axiomatization is an ipmrovement of, in the sense that it has a kind of the subformula property and is a slight modification of. In this system the cut rule is eliminated. The second axiomatization is a classical conservative extension of basic propositional logic. Using these axiomatizations, we prove interpolation theorems for basic propositional logic.
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
1 — 50 / 496