Related categories

6703 found
Order:
1 — 50 / 6703
Material to categorize
  1. On Free Annotated Algebras.Renato A. Lewin, Irene F. Mikenberg & Marı́a G. Schwarze - 2001 - Annals of Pure and Applied Logic 108 (1-3):249-259.
    In Lewin et al. 359–386) the authors proved that certain systems of annotated logics are algebraizable in the sense of Block and Rigozzi 396). Later in Lewin et al. the study of the associated quasi-varieties of annotated algebras is initiated. In this paper we continue the study of the these classes of algebras, in particular, we report some recent results about the free annotated algebras.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  2. M. Abad Varieties of Three-Valued.A. M. Suardiaz A. Quantifier - forthcoming - Studia Logica.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  3. On Three-Valued Moisil Algebras.M. Abad & L. Monteiro - 1984 - Logique Et Analyse 27 (8):407-414.
  4. 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  
     
    Export citation  
     
    Bookmark   1 citation  
  5. Orthoimplication Algebras.J. C. Abbott - 1976 - Studia Logica 35 (2):173 - 177.
    Orthologic is defined by weakening the axioms and rules of inference of the classical propositional calculus. The resulting Lindenbaum-Tarski quotient algebra is an orthoimplication algebra which generalizes the author's implication algebra. The associated order structure is a semi-orthomodular lattice. The theory of orthomodular lattices is obtained by adjoining a falsity symbol to the underlying orthologic or a least element to the orthoimplication algebra.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6. A Note On Curry Algebras.Jair Abe - 1987 - Bulletin of the Section of Logic 16 (4):151-156.
    In one of its possible formulations, the principle of the excluded middle says that, from two propositions A and ¬A , one is true. A paracomplete logic is a logic which can be the basis of theories in which there are propositions A such that A and ¬A are both false. So, we may assert that in a paracomplete logic the law of the excluded middle fails. For a discussion of such kind of logic, as well as for the study (...)
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  7. Annotated Logics Qt and Ultraproducts.Jair Minoro Abe & Seiki Akama - 1997 - Logique Et Analyse 160:335-343.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  8. Minimal "Sum of Products of Sums" Expressions of Boolean Functions.Shreeram Abhyankar - 1959 - Journal of Symbolic Logic 24 (3):254-255.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  9. Domain Theory in Logical Form.Samson Abramsky - 1991 - Annals of Pure and Applied Logic 51 (1-2):1-77.
    Abramsky, S., Domain theory in logical form, Annals of Pure and Applied Logic 51 1–77. The mathematical framework of Stone duality is used to synthesise a number of hitherto separate developments in theoretical computer science.• Domain theory, the mathematical theory of computation introduced by Scott as a foundation for detonational semantics• The theory of concurrency and systems behaviour developed by Milner, Hennesy based on operational semantics.• Logics of programsStone duality provides a junction between semantics and logics . Moreover, the underlying (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  10. A Comparison Between Lambek Syntactic Calculus and Intuitionistic Linear Propositional Logic.V. Michele Abrusci - 1990 - Mathematical Logic Quarterly 36 (1):11-15.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  11. Non‐Commutative Intuitionistic Linear Logic.V. Michele Abrusci - 1990 - Mathematical Logic Quarterly 36 (4):297-318.
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  12. Some Uses of Dilators in Combinatorial Problems. II.V. Michele Abrusci, Jean-Yves Girard & Jacques Van De Wiele - 1990 - Journal of Symbolic Logic 55 (1):32 - 40.
    We study increasing F-sequences, where F is a dilator: an increasing F-sequence is a sequence (indexed by ordinal numbers) of ordinal numbers, starting with 0 and terminating at the first step x where F(x) is reached (at every step x + 1 we use the same process as in decreasing F-sequences, cf. [2], but with "+ 1" instead of "- 1"). By induction on dilators, we shall prove that every increasing F-sequence terminates and moreover we can determine for every dilator (...)
    Remove from this list   Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  13. Review: Toshio Umezawa, On Intermediate Many-Valued Logics. [REVIEW]W. Ackermann - 1959 - Journal of Symbolic Logic 24 (3):250-250.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  14. Umezawa Toshio. On Intermediate Many-Valued Logics. Journal of the Mathematical Society of Japan, Bd. 11 Heft 2 , S. 116–128. [REVIEW]W. Ackermann - 1959 - Journal of Symbolic Logic 24 (3):250.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15. Review: Robert Stanley, An Extended Procedure in Quantificational Logic. [REVIEW]Wilhelm Ackermann - 1956 - Journal of Symbolic Logic 21 (2):197-197.
  16. Review: Yoemon Sampei, On the Orthogonal Expansion of the Boolean Polynomial and Its Applications I; Yoemon Sampei, On the Orthogonal Expansion of the Boolean Polynomial and Its Applications. [REVIEW]Wilhelm Ackermann - 1956 - Journal of Symbolic Logic 21 (4):401-402.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  17. Stanley Robert. An Extended Procedure in Quantificational Logic.Wilhelm Ackermann - 1956 - Journal of Symbolic Logic 21 (2):197.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18. Sampei Yoemon. On the Orthogonal Expansion of the Boolean Polynomial and its Applications I. Journal of the Faculty of Science, Hokkaido University, Series I, Bd. 11 Heft 3 , S. 113–125.Sampei Yoemon. On the Orthogonal Expansion of the Boolean Polynomial and its Applications II. Commentarii Mathematici Universitatis Sancti Pauli, Bd. 1 Heft 2 , S. 51–57. [REVIEW]Wilhelm Ackermann - 1956 - Journal of Symbolic Logic 21 (4):401-402.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  19. Dienes Paul. On Ternary Logic.Wilhelm Ackermann - 1950 - Journal of Symbolic Logic 15 (3):225.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20. Review: Paul Dienes, On Ternary Logic. [REVIEW]Wilhelm Ackermann - 1950 - Journal of Symbolic Logic 15 (3):225-225.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  21. Review: F.I. Andon, Ob Odnom Podhode K Minimizacii Sistem Buleoyh Funkcij (On One Approach to the Minimization of Systems of Boolean Functions); F. I. Andon, Algoritm Uproscenia D.N.F. Bulevyh Funckij (A Simplification Alogorithm of a Disjunctive Normal Form of the Boolean Functions). [REVIEW]A. Adam - 1970 - Journal of Symbolic Logic 35 (2):330-330.
  22. Review: G. N. Povarov, On the Group Invariance of Boolean Functions. [REVIEW]A. Adam - 1970 - Journal of Symbolic Logic 35 (1):161-162.
  23. Review: U. I. Zuravlev, Set-Theoretical Methods in the Algebra of Logic. [REVIEW]A. Adam - 1970 - Journal of Symbolic Logic 35 (1):162-162.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24. Review: V. V. Vojtišék, Ob Odnom Podhode K Klassifikacii Bulevyh Funkcij (On an Approach to the Classification of Boolean Functions). [REVIEW]A. Ádám - 1970 - Journal of Symbolic Logic 35 (4):593-593.
  25. Set-Theoretical Methods in the Algebra of Logic.A. Adam & U. I. Zuravlev - 1970 - Journal of Symbolic Logic 35 (1):162.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26. On the Logic of High Probability.Ernest W. Adams - 1986 - Journal of Philosophical Logic 15 (3):255 - 279.
  27. A game-based formal system L.A. Adamson - 1979 - Studia Logica 38:49.
  28. The Kleene Symposium and the Summer Meeting of the Association for Symbolic Logic, Madison 1978.John Addison, Jon Barwise, H. Jerome Keisler, Kenneth Kunen & Yiannis N. Moschovakis - 1979 - Journal of Symbolic Logic 44 (3):469-480.
  29. A Gentzen System Equivalent to the BCK-Logic'.R. Adillon & Ventura Verdú - 1996 - Bulletin of the Section of Logic 25 (2):73-79.
  30. Richard Routley Postscript: Some Setbacks on the Choice and Descriptions Adventure.Descriptions Adventure - 1974 - In Edgar Morscher, Johannes Czermak & Paul Weingartner (eds.), Problems in Logic and Ontology. Akadem. Druck- U. Verlagsanst.. pp. 223.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  31. Two Valued Logic in Ordinary Circumstances.J. Agassi - 1985 - International Logic Review 32:83.
    Remove from this list  
     
    Export citation  
     
    Bookmark  
  32. Basic Hoops: An Algebraic Study of Continuous T -Norms.P. Aglianò, I. M. A. Ferreirim & F. Montagna - 2007 - Studia Logica 87 (1):73 - 98.
    A continuoxis t- norm is a continuous map * from [0, 1]² into [0,1] such that ([ 0,1], *, 1) is a commutative totally ordered monoid. Since the natural ordering on [0,1] is a complete lattice ordering, each continuous t-norm induces naturally a residuation → and ([ 0,1], *, →, 1) becomes a commutative naturally ordered residuated monoid, also called a hoop. The variety of basic hoops is precisely the variety generated by all algebras ([ 0,1], *, →, 1), where (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  33. Basic Hoops: An Algebraic Study of Continuous T-Norms.P. Aglianò, I. M. A. Ferreirim & F. Montagna - 2007 - Studia Logica 87 (1):73-98.
    A continuoxis t- norm is a continuous map * from [0, 1]² into [0,1] such that is a commutative totally ordered monoid. Since the natural ordering on [0,1] is a complete lattice ordering, each continuous t-norm induces naturally a residuation → and becomes a commutative naturally ordered residuated monoid, also called a hoop. The variety of basic hoops is precisely the variety generated by all algebras, where * is a continuous t-norm. In this paper we investigate the structure of the (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  34. Varieties of BL-Algebras II.P. Aglianò & F. Montagna - 2018 - Studia Logica 106 (4):721-737.
    In this paper we introduce a poset of subvarieties of BL-algebras, whose completion is the entire lattice of subvarietes; we exhibit also a description of this poset in terms of finite sequences of functions on the natural numbers.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35. Translating Non-Classical Logics Into Classical Logic by Using Hidden Variables.Juan C. Agudelo-Agudelo - 2017 - Logica Universalis 11 (2):205-224.
    Dyadic semantics is a sort of non-truth-functional bivalued semantics introduced in Caleiro et al. Logica Universalis, Birkhäuser, Basel, pp 169–189, 2005). Here we introduce an algorithmic procedure for constructing conservative translations of logics characterised by dyadic semantics into classical propositional logic. The procedure uses fresh propositional variables, which we call hidden variables, to represent the indeterminism of dyadic semantics. An alternative algorithmic procedure for constructing conservative translations of any finite-valued logic into classical logic is also introduced. In this alternative procedure (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36. On Polynomial Semantics for Propositional Logics.Juan C. Agudelo-Agudelo, Carlos A. Agudelo-González & Oscar E. García-Quintero - 2016 - Journal of Applied Non-Classical Logics 26 (2):103-125.
    Some properties and an algorithm for solving systems of multivariate polynomial equations over finite fields are presented. It is then shown how formulas of propositional logics can be translated into polynomials over finite fields in such a way that several logic problems are expressed in terms of algebraic problems. Consequently, algebraic properties and algorithms can be used to solve the algebraically-represented logic problems. The methods described herein combine and generalise those of various previous works.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  37. The Free N -Generated BL-Algebra.Stefano Aguzzoli & Simone Bova - 2010 - Annals of Pure and Applied Logic 161 (9):1144-1170.
    For each integer n≥0, we provide an explicit functional characterization of the free n-generated BL-algebra, together with an explicit construction of the corresponding normal forms.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38. Probability Measures in the Logic of Nilpotent Minimum.Stefano Aguzzoli & Brunella Gerla - 2010 - Studia Logica 94 (2):151-176.
    We axiomatize the notion of state over finitely generated free NM-algebras, the Lindenbaum algebras of pure Nilpotent Minimum logic. We show that states over the free n -generated NM-algebra exactly correspond to integrals of elements of with respect to Borel probability measures.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  39. De Finetti's No-Dutch-Book Criterion for Gödel Logic.Stefano Aguzzoli, Brunella Gerla & Vincenzo Marra - 2008 - Studia Logica 90 (1):25 - 41.
    We extend de Finetti’s No-Dutch-Book Criterion to Gödel infinite-valued propositional logic.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  40. De Finetti’s No-Dutch-Book Criterion for Gödel Logic.Stefano Aguzzoli, Brunella Gerla & Vincenzo Marra - 2008 - Studia Logica 90 (1):25-41.
    We extend de Finetti's No-Dutch-Book Criterion to Gödel infinite-valued propositional logic.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  41. Varying Interpolation and Amalgamation in Polyadic MV-Algebras.Tarek Sayed Ahmed - 2015 - Journal of Applied Non-Classical Logics 25 (2):140-192.
    We prove several interpolation theorems for many-valued infinitary logic with quantifiers by studying expansions of MV-algebras in the spirit of polyadic and cylindric algebras. We prove for various reducts of polyadic MV-algebras of infinite dimensions that if is the free algebra in the given signature,, is in the subalgebra of generated by, is in the subalgebra of generated by and, then there exists an interpolant in the subalgebra generated by and such that. We call this a varying interpolation property because (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  42. On the Interpretation of Attitude Logics.Tuomo Aho - 1994 - In Dag Prawitz & Dag Westerståhl (eds.), Logic and Philosophy of Science in Uppsala. Kluwer Academic Publishers. pp. 1--11.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  43. Logic for Physical Space: From Antiquity to Present Days.Marco Aiello, Guram Bezhanishvili, Isabelle Bloch & Valentin Goranko - 2012 - Synthese 186 (3):619-632.
    Since the early days of physics, space has called for means to represent, experiment, and reason about it. Apart from physicists, the concept of space has intrigued also philosophers, mathematicians and, more recently, computer scientists. This longstanding interest has left us with a plethora of mathematical tools developed to represent and work with space. Here we take a special look at this evolution by considering the perspective of Logic. From the initial axiomatic efforts of Euclid, we revisit the major milestones (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  44. Handbook of Spatial Logics.Marco Aiello, Ian E. Pratt-Hartmann & Johan van Benthem (eds.) - 2007 - Springer Verlag.
    Remove from this list  
     
    Export citation  
     
    Bookmark   2 citations  
  45. An Institution-Independent Proof of the Beth Definability Theorem.M. Aiguier & F. Barbier - 2007 - Studia Logica 85 (3):333-359.
    A few results generalizing well-known classical model theory ones have been obtained in institution theory these last two decades (e.g. Craig interpolation, ultraproduct, elementary diagrams). In this paper, we propose a generalized institution-independent version of the Beth definability theorem.
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  46. 1. Infon Logic Based On Constructive Logic.Seiki Akama - 2006 - Logique Et Analyse 49.
    Remove from this list  
     
    Export citation  
     
    Bookmark   1 citation  
  47. Subformula Semantics for Strong Negation Systems.Seiki Akama - 1990 - Journal of Philosophical Logic 19 (2):217 - 226.
    We present a semantics for strong negation systems on the basis of the subformula property of the sequent calculus. The new models, called subformula models, are constructed as a special class of canonical Kripke models for providing the way from the cut-elimination theorem to model-theoretic results. This semantics is more intuitive than the standard Kripke semantics for strong negation systems.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  48. Three-Valued Temporal Logic Q T and Future Contingents.Seiki Akama, Yasunori Nagata & Chikatoshi Yamada - 2008 - Studia Logica 88 (2):215-231.
    Prior's three-valued modal logic Q was developed as a philosophically interesting modal logic. Thus, we should be able to modify Q as a temporal logic. Although a temporal version of Q was suggested by Prior, the subject has not been fully explored in the literature. In this paper, we develop a three-valued temporal logic $Q_t $ and give its axiomatization and semantics. We also argue that $Q_t $ provides a smooth solution to the problem of future contingents.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49. A Truth Table Method for the Synthesis of Combinational Logic.Sheldon B. Akers - 1963 - Journal of Symbolic Logic 28 (4):290-290.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  50. Monadic Bounded Algebras.Galym Akishev & Robert Goldblatt - 2010 - Studia Logica 96 (1):1 - 40.
    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 representation of (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
1 — 50 / 6703