The complexity of McNaughton functions of one variable

DOI10.1006/aama.1998.0581zbMath0911.03004OpenAlexW2043639987MaRDI QIDQ1271879

Stefano Aguzzoli

Publication date: 4 May 1999

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aama.1998.0581

zbMATH Keywords

piecewise linearMcNaughton functionsLukasiewicz calculus

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Mechanization of proofs and logical operations (03B35) Many-valued logic (03B50)

Related Items

Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability, On normal forms in Łukasiewicz logic, Generalized consistency degrees of theories w.r.t. formulas in several standard complete logic systems, Word problems in Elliott monoids, An efficient algorithm for representing piecewise linear functions into logic, On the failure of the finite model property in some fuzzy description logics, A discrete free MV-algebra over one generator

Cites Work

• Unnamed Item
• Unnamed Item
• Satisfiability in many-valued sentential logic is NP-complete
• Resolution and model building in the infinite-valued calculus of Łukasiewicz
• An algorithmic desingularization of 3-dimensional toric varieties
• Fragments of Many-Valued Statement Calculi
• A constructive proof of McNaughton's theorem in infinite-valued logic
• A geometric proof of the completeness of the Łukasiewicz calculus
• A theorem about infinite-valued sentential logic