Mental models, model-theoretic semantics, and the psychosemantic conception of truth
Shira Elqayam (2005)
Philosophia Scientiae
Similarity:
Shira Elqayam (2005)
Philosophia Scientiae
Similarity:
Marković, Zoran (1984)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Markovic, Zoran (1981)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
E. López-Escobar (1981)
Fundamenta Mathematicae
Similarity:
Dana Scott (1968)
Compositio Mathematica
Similarity:
Nenad Krdžavac, Dragan Gašević, Vladan Devedžić (2009)
Computer Science and Information Systems
Similarity:
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...
Milenko Mosurović, Tatjana Stojanović, Ana Kaplarević-Mališić (2009)
Zbornik Radova
Similarity:
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...
Barbara Dunin-Kęplicz, Linh Anh Nguyen, Andrzej Sza l as (2010)
Computer Science and Information Systems
Similarity:
Mariusz Giero (2016)
Formalized Mathematics
Similarity:
This article introduces propositional logic as a formal system ([14], [10], [11]). The formulae of the language are as follows φ ::= ⊥ | p | φ → φ. Other connectives are introduced as abbrevations. The notions of model and satisfaction in model are defined. The axioms are all the formulae of the following schemes α ⇒ (β ⇒ α), (α ⇒ (β ⇒ γ)) ⇒ ((α ⇒ β) ⇒ (α ⇒ γ)), (¬β ⇒ ¬α) ⇒ ((¬β ⇒ α) ⇒ β). Modus ponens is the only derivation rule. The soundness theorem and the strong completeness theorem...