Effective Finite-Valued Approximations of General Propositional Logics (Q5452176): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The semantics and proof theory of linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeled calculi and finite-valued logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systematization of finite many-valued logics through the method of tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3867808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A propositional calculus with denumerable matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantical investigations in Heyting's intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability in many-valued sentential logic is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability and the finite model property / rank
 
Normal rank

Latest revision as of 19:57, 27 June 2024

scientific article; zbMATH DE number 5252774
Language Label Description Also known as
English
Effective Finite-Valued Approximations of General Propositional Logics
scientific article; zbMATH DE number 5252774

    Statements