Standard Completeness for Extensions of MTL: An Automated Approach
From MaRDI portal
Publication:2915024
DOI10.1007/978-3-642-32621-9_12zbMath1361.68184OpenAlexW2567733MaRDI QIDQ2915024
Lara Spendier, Agata Ciabattoni, Paolo Baldi
Publication date: 21 September 2012
Published in: Logic, Language, Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32621-9_12
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Densification of FL chains via residuated frames ⋮ Tools for the Investigation of Substructural and Paraconsistent Logics ⋮ A note on standard completeness for some extensions of uninorm logic ⋮ Comparing Calculi for First-Order Infinite-Valued Łukasiewicz Logic and First-Order Rational Pavelka Logic ⋮ On some questions concerning the axiomatisation of WNM-algebras and their subvarieties ⋮ Density revisited ⋮ Hypersequent and display calculi -- a unified perspective ⋮ Uniform proofs of standard completeness for extensions of first-order MTL ⋮ AxiomCalc
This page was built for publication: Standard Completeness for Extensions of MTL: An Automated Approach
