Switch to: References

Add citations

You must login to add citations.
  1. Logic, Language, Information and Computation: 15th International Workshop, Wollic 2008 Edinburgh, Uk, July 1-4, 2008, Proceedings.Wilfrid Hodges & Ruy de Queiroz (eds.) - 2008 - Berlin and New York: Springer.
    Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the 4th volume of the FoLLI LNAI subline; containing the refereed proceedings of the 15th International Workshop on Logic, Language, Information and Computation, WoLLIC 2008, held in Edinburgh, UK, in July 2008. The 21 revised full papers presented together with the abstracts of 7 tutorials and invited lectures were carefully reviewed and selected from numerous submissions. The papers cover all pertinent subjects in computer science with (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Mathematical fuzzy logics.Siegfried Gottwald - 2008 - Bulletin of Symbolic Logic 14 (2):210-239.
    The last decade has seen an enormous development in infinite-valued systems and in particular in such systems which have become known as mathematical fuzzy logics. The paper discusses the mathematical background for the interest in such systems of mathematical fuzzy logics, as well as the most important ones of them. It concentrates on the propositional cases, and mentions the first-order systems more superficially. The main ideas, however, become clear already in this restricted setting.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Linear Logic and Lukasiewicz ℵ0- Valued Logic: A Logico-Algebraic Study.Jayanta Sen & M. K. Chakraborty - 2001 - Journal of Applied Non-Classical Logics 11 (3-4):313-329.
    A new characterization of all the MV-algebras embedded in a CL-algebra has been presented. A new sequent calculus for Lukasiewicz ℵ0-valued logic is introduced. Some links between this calculus and the sequent calculus for multiplicative additive linear logic are established. It has been shown that Lukasiewicz ℵ0-valued logic can be embedded in a suitable extension of MALL.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Proving properties of binary classification neural networks via Łukasiewicz logic.Sandro Preto & Marcelo Finger - 2023 - Logic Journal of the IGPL 31 (5):805-821.
    Neural networks are widely used in systems of artificial intelligence, but due to their black box nature, they have so far evaded formal analysis to certify that they satisfy desirable properties, mainly when they perform critical tasks. In this work, we introduce methods for the formal analysis of reachability and robustness of neural networks that are modeled as rational McNaughton functions by, first, stating such properties in the language of Łukasiewicz infinitely-valued logic and, then, using the reasoning techniques of such (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Structural Completeness in Many-Valued Logics with Rational Constants.Joan Gispert, Zuzana Haniková, Tommaso Moraschini & Michał Stronkowski - 2022 - Notre Dame Journal of Formal Logic 63 (3):261-299.
    The logics RŁ, RP, and RG have been obtained by expanding Łukasiewicz logic Ł, product logic P, and Gödel–Dummett logic G with rational constants. We study the lattices of extensions and structural completeness of these three expansions, obtaining results that stand in contrast to the known situation in Ł, P, and G. Namely, RŁ is hereditarily structurally complete. RP is algebraized by the variety of rational product algebras that we show to be Q-universal. We provide a base of admissible rules (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Giles’s Game and the Proof Theory of Łukasiewicz Logic.Christian G. Fermüller & George Metcalfe - 2009 - Studia Logica 92 (1):27 - 61.
    In the 1970s, Robin Giles introduced a game combining Lorenzen-style dialogue rules with a simple scheme for betting on the truth of atomic statements, and showed that the existence of winning strategies for the game corresponds to the validity of formulas in Łukasiewicz logic. In this paper, it is shown that ‘disjunctive strategies’ for Giles’s game, combining ordinary strategies for all instances of the game played on the same formula, may be interpreted as derivations in a corresponding proof system. In (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   6 citations