Satisfaction and Friendliness Relations within Classical Logic: Proof-Theoretic Approach

DOI10.1007/978-3-642-00665-4_15zbMath1236.03012OpenAlexW2114325607MaRDI QIDQ3623837

A. Yu. Muravitskij

Publication date: 24 April 2009

Published in: Logic, Language, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00665-4_15

zbMATH Keywords

completeness theoremsatisfiabilitylogical friendlinessstrong compactness property

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Classical propositional logic (03B05)

Related Items (1)

On nonmonotonic consequence relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Satisfaction and Friendliness Relations within Classical Logic: Proof-Theoretic Approach