A characterization theorem for injective model classes axiomatized by general rules
DOI10.1016/j.tcs.2006.02.025zbMath1096.03027OpenAlexW2093294226WikidataQ114129194 ScholiaQ114129194MaRDI QIDQ2503323
Zhaohui Zhu, Shan Lu, Rong Zhang
Publication date: 14 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.02.025
nonmonotonic logicaxiomatizabilitysecond-order definabilityinjective inference relationinjective preferential modelspartial order structures
Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Second- and higher-order model theory (03C85) Model theory of ordered structures; o-minimality (03C64)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonmonotonic reasoning, preferential models and cumulative logics
- Model theory.
- What does a conditional knowledge base entail?
- Supracompact inference operations
- A representation theorem for recovering contraction relations satisfying wci
- Normal conditions for inference relations and injective models
- Similarity between preferential models
- Injective Models and Disjunctive Relations
- Belief contraction in the context of the general theory of rational choice
- Beyond rational monotony: some strong non-horn rules for nonmonotonic inference relations
- Belief contraction as nonmonotonic inference
- On representation theorems for nonmonotonic consequence relations
- Valuation structure
- On negation rationality
This page was built for publication: A characterization theorem for injective model classes axiomatized by general rules
