Name
Abstract | ||
|---|---|---|
In this paper we investigate the simple logical properties of contexts. We describe both the syntax and semantics of a general propositional language of context, and give a Hilbert style proof system for this language. A propositional logic of context extends classical propositional logic in two ways. Firstly, a new modality, ist(k, φ), is introduced. It is used to express that the sentence, φ, holds in the context k. Secondly, each context has its own vocabulary, i.e. a set of propositional atoms which are defined or meaningful in that context. The main results of this paper are the soundness and completeness of this Hilbert style proof system. We also provide soundness and completeness results (i.e. correspondence theory) for various extensions of the general system. |
Year | Venue | Keywords |
|---|---|---|
1993 | AAAI | main result,hilbert style proof system,general system,propositional logic,general propositional language,context k,correspondence theory,classical propositional logic,completeness result,propositional atom |
Field | DocType | ISBN |
Autoepistemic logic,Computer science,Zeroth-order logic,Decidability,Artificial intelligence,Resolution (logic),Well-formed formula,Algebra,Algorithm,Complete theory,Propositional formula,Machine learning,Propositional variable | Conference | 0-262-51071-5 |
Citations | PageRank | References |
53 | 10.20 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Saša Buvač | 1 | 184 | 30.60 |
| Ian A. Mason | 2 | 797 | 97.47 |