Mental models, model-theoretic semantics, and the psychosemantic conception of truth
Shira Elqayam (2005)
Philosophia Scientiae
Similarity:
Displaying similar documents to “Simplifying the propositional satisfiability problem by sub-model propagation.”
Mental models, model-theoretic semantics, and the psychosemantic conception of truth
Kripke models for intuitionistic theories with decidable atomic formulas.
Marković, Zoran (1984)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
On axiomatizability and preservation in Kripke models.
Markovic, Zoran (1981)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Integrating intuitionistic and classical theories
E. López-Escobar (1981)
Fundamenta Mathematicae
Similarity:
Extending the topological interpretation to intuitionistic analysis
Dana Scott (1968)
Compositio Mathematica
Similarity:
Model Driven Engineering of a Tableau Algorithm for Description Logics
Nenad Krdžavac, Dragan Gašević, Vladan Devedžić (2009)
Computer Science and Information Systems
Similarity:
Computational logics and the philosophy of language: the problem of lexical meaning in formal semantics.
Marcello Frixione (1996)
Mathware and Soft Computing
Similarity:
This paper deals with the possible contributions that logical researches carried on in the field of artificial intelligence (AI) could give to formal theories of meaning developed by logically oriented philosophers of language within the tradition of analytic philosophy. In particular, I will take into account a topic which is problematic in many respects for traditional logical accounts of meaning, i.e., the problem of lexical semantics. My thesis is that AI logics could give useful...
Reasoning in Basic Description Logics and Description Logics with Modal Operators
Milenko Mosurović, Tatjana Stojanović, Ana Kaplarević-Mališić (2009)
Zbornik Radova
Similarity:
On sequent calculi for intuitionistic propositional logic
Vítězslav Švejdar (2006)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
The well-known Dyckoff's 1992 calculus/procedure for intuitionistic propositional logic is considered and analyzed. It is shown that the calculus is Kripke complete and the procedure in fact works in polynomial space. Then a multi-conclusion intuitionistic calculus is introduced, obtained by adding one new rule to known calculi. A simple proof of Kripke completeness and polynomial-space decidability of this calculus is given. An upper bound on the depth of a Kripke counter-model is...