Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)A theorem about infinite-valued sentential logic.Robert McNaughton - 1951 - Journal of Symbolic Logic 16 (1):1-13.
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • (1 other version)Die nichtaxiomatisierbarkeit Des unendlichwertigen prädikatenkalküls Von łukasiewicz.Bruno Scarpellini - 1962 - Journal of Symbolic Logic 27 (2):159-170.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Fragments of Many-valued Statement Calculi.Alan Rose & John Barkley Rosser - 1958 - [S.N.].
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Forcing in Model Theory.Abraham Robinson, Jon Barwise & J. E. Fenstad - 1975 - Journal of Symbolic Logic 40 (4):633-634.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • On Theories and Models in Fuzzy Predicate Logics.Petr Hájek & Petr Cintula - 2006 - Journal of Symbolic Logic 71 (3):863 - 880.
    In the last few decades many formal systems of fuzzy logics have been developed. Since the main differences between fuzzy and classical logics lie at the propositional level, the fuzzy predicate logics have developed more slowly (compared to the propositional ones). In this text we aim to promote interest in fuzzy predicate logics by contributing to the model theory of fuzzy predicate logics. First, we generalize the completeness theorem, then we use it to get results on conservative extensions of theories (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • (1 other version)A Theorem About Infinite-Valued Sentential Logic.Robert Mcnaughton - 1951 - Journal of Symbolic Logic 16 (3):227-228.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Simplicial structures in MV-algebras and logic.L. P. Belluce & A. Di Nola - 2007 - Journal of Symbolic Logic 72 (2):584-600.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Abraham Robinson. Forcing in model theory. Symposia mathematica, vol. 5, Istituto Nazionale di Alta Matematica, Academic Press, London and New York 1971, pp. 69–82. - Jon Barwise and Abraham Robinson. Completing theories by forcing. Annals of mathematical logic, vol. 2 no. 2 , pp. 119–142. - Abraham Robinson. Infinite forcing in model theory. Proceedings of the Second Scandinavian Logic Symposium, edited by J. E. Fenstad, Studies in logic and the foundations of mathematics, vol. 63, North-Holland Publishing Company, Amsterdam and London 1971, pp. 317–340. - Abraham Robinson. Forcing in model theory. Actes du Congrès International des Mathematiciens 1970, Gauthier-Villars, Paris 1971, Vol. 1, pp. 245–250. [REVIEW]H. Jerome Keisler - 1975 - Journal of Symbolic Logic 40 (4):633-634.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The liar paradox and fuzzy logic.Petr Hájek, Jeff Paris & John Shepherdson - 2000 - Journal of Symbolic Logic 65 (1):339-346.
    Can one extend crisp Peano arithmetic PA by a possibly many-valued predicate Tr(x) saying "x is true" and satisfying the "dequotation schema" $\varphi \equiv \text{Tr}(\bar{\varphi})$ for all sentences φ? This problem is investigated in the frame of Lukasiewicz infinitely valued logic.
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • On arithmetic in the Cantor- Łukasiewicz fuzzy set theory.Petr Hájek - 2005 - Archive for Mathematical Logic 44 (6):763-782.
    Axiomatic set theory with full comprehension is known to be consistent in Łukasiewicz fuzzy predicate logic. But we cannot assume the existence of natural numbers satisfying a simple schema of induction; this extension is shown to be inconsistent.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Rational Pavelka predicate logic is a conservative extension of łukasiewicz predicate logic.Petr Hajek, Jeff Paris & John Shepherdson - 2000 - Journal of Symbolic Logic 65 (2):669-682.
    Rational Pavelka logic extends Lukasiewicz infinitely valued logic by adding truth constants r̄ for rationals in [0, 1]. We show that this is a conservative extension. We note that this shows that provability degree can be defined in Lukasiewicz logic. We also give a counterexample to a soundness theorem of Belluce and Chang published in 1963.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • (1 other version)Omitting types of prenex formulas.C. C. Chang - 1967 - Journal of Symbolic Logic 32 (1):61-74.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Completing theories by forcing.J. Barwise - 1970 - Annals of Mathematical Logic 2 (2):119.
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Algebraizable Logics.W. J. Blok & Don Pigozzi - 2022 - Advanced Reasoning Forum.
    W. J. Blok and Don Pigozzi set out to try to answer the question of what it means for a logic to have algebraic semantics. In this seminal book they transformed the study of algebraic logic by giving a general framework for the study of logics by algebraic means. The Dutch mathematician W. J. Blok (1947-2003) received his doctorate from the University of Amsterdam in 1979 and was Professor of Mathematics at the University of Illinois, Chicago until his death in (...)
    Download  
     
    Export citation  
     
    Bookmark   137 citations