On evaluations of propositional formulas in countable structures

DOI10.2298/FIL1601001PMaRDI QIDQ5279264zbMATH OpenOpenAlexFDO

Authors Dragan Doder, Miodrag Rašković, Aleksandar Perović, Zoran Ognjanović

Publication date 19 July 2017

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/fil1601001p

zbMATH Keywords

axiomatizationstrong completenessweighted formulas

Mathematics Subject Classification ID

Classical propositional logic (03B05) Model theory of denumerable and separable structures (03C15) Other infinitary logic (03C75)

Recommendations

• Fuzzy logic with countable evaluated syntax revisited
• scientific article; zbMATH DE number 3939323
• Effective Finite-Valued Approximations of General Propositional Logics
• Proving infinitary formulas
• Countable models and infinite trees

Cited in

(3)

• On Number of Lindenbaum's Oversystems of Propositional and Predicate Calculi
• Applications of Logics About Simple Probabilities
• Logics for at most countable first-order structures

This page was built for publication: On evaluations of propositional formulas in countable structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5279264)