A constructive proof of McNaughton's theorem in infinite-valued logic
From MaRDI portal
Publication:4302355
DOI10.2307/2275410zbMath0807.03012OpenAlexW2054457993MaRDI QIDQ4302355
Publication date: 15 August 1994
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275410
Constructive and recursive analysis (03F60) Many-valued logic (03B50) Turing machines and related notions (03D10)
Related Items
A characterization of the free \(n\)-generated MV-algebra ⋮ Łukasiewicz Games ⋮ Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability ⋮ On normal forms in Łukasiewicz logic ⋮ \(\mu \)MV-algebras: An approach to fixed points in Łukasiewicz logic ⋮ A characterization of truth-functions in the nilpotent minimum logic ⋮ Normal forms for fuzzy logic functions and their approximation ability ⋮ Averaging the truth-value in Łukasiewicz logic ⋮ Bernoulli automorphisms of finitely generated free MV-algebras ⋮ Many-valued logic and mixed integer programming ⋮ A geometric proof of the completeness of the Łukasiewicz calculus ⋮ Normal forms for fuzzy logics: a proof-theoretic approach ⋮ Layers of zero probability and stable coherence over Łukasiewicz events ⋮ THREE CHARACTERIZATIONS OF STRICT COHERENCE ON INFINITE-VALUED EVENTS ⋮ The free \(n\)-generated BL-algebra ⋮ Invariant Measures in Free MV-Algebras ⋮ Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics ⋮ An efficient algorithm for representing piecewise linear functions into logic ⋮ On standard completeness and finite model property for a probabilistic logic on Łukasiewicz events ⋮ Ł\(\Pi\) logic with fixed points ⋮ A discrete representation of free MV-algebras ⋮ Symbolic Knowledge Extraction from Trained Neural Networks Governed by Łukasiewicz Logics ⋮ Decidable and undecidable prime theories in infinite-valued logic ⋮ Note on the construction of free MV-algebras ⋮ The coherence of Łukasiewicz assessments is NP-complete ⋮ Adding structure to MV-algebras ⋮ An asymptotically tight bound on countermodels for Łukasiewicz logic ⋮ Generic substitutions ⋮ A discrete free MV-algebra over one generator ⋮ Varieties of MV-algebras ⋮ The complexity of McNaughton functions of one variable ⋮ Unnamed Item ⋮ Łukasiewicz logics for cooperative games ⋮ Semiring and Semimodule Issues in MV-Algebras ⋮ The spectrum problem for abelian \(\ell\)-groups and MV-algebras ⋮ Piecewise-Linear Neural Networks and Their Relationship to Rule Extraction from Data ⋮ Geometrical methods in Wajsberg hoops ⋮ Complexity issues in Basic Logic
Cites Work