Results 81 to 90 of about 39,273,340 (170)

Some lessons from Kripke’s a puzzle about belief

open access: yesStellenbosch Papers in Linguistics, 2011
The literature on Kripke’s A Puzzle About Belief has delivered convincing answers to the problem raised by Kripke. This is so both for referentialists and descriptivists. In this article I consider what I take to be the best responses of both parties and
Smit, J. P.
doaj   +1 more source

Coalgebraic Epistemic Update without Change of Model [PDF]

open access: yes, 2007
We present a coalgebraic semantics for reasoning about information update in multi-agent systems. The novelty is that we have one structure for both states and actions and thus our models do not involve the ”change-of-model” phenomena that arise when ...
C. Cirstea   +7 more
core  

Kripke Semantics for a Logical Framework [PDF]

open access: yes, 1993
We present a semantics (using Kripke lambda models) for a logical framework (minimal implicational predicate logic with quantification over all higher types). We apply the semantics to obtain straightforward adequacy proofs for encodings of logics in the
Simpson, Alex, Alex K. Simpson
core  

Semantic Scepticism: Normativity and Naturalism [PDF]

open access: yes, 2011
The present thesis is a response to Kripke’s sceptical argument for the conclusion that there are no facts of the matter concerning what any speaker means by any expression.
Jones, Matthew
core   +3 more sources

Algebraic and Kripke semantics of substructural logics

open access: yes, 2011
This thesis is about the distributive full Lambek calculus, i.e., intuicionistic logic without the structural rules of exchange, contraction and weakening and particularly about the two semantics of this logic, one of which is algebraic, the other one is
Arazim, Pavel
core   +1 more source

Kripke semantics for provability logic GLP [PDF]

open access: yes, 2007
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in arithmetic [9, 5, 8].
Beklemishev, L.D.
core  

Some Additional Axioms for T-normal Logics. Defining K45, KB4, KD45 and S5 without Using Modal Rules

open access: yesBulletin of the Section of Logic
The paper studies extensions of t-normal logics S0.5o and S0.5 obtained by means of some axioms of normal logics. We will prove determination theorems for these extensions by appropriate Kripke-style models.
Andrzej Pietruszczak
doaj   +1 more source

A Logical Modeling of Severe Ignorance. [PDF]

open access: yesJ Philos Logic, 2023
Bonzio S   +3 more
europepmc   +1 more source

Decidability of Multi-agent Logic of Computation Trees $\mathcal{CTLK}^{Rel}$

open access: yesИзвестия Иркутского государственного университета: Серия "Математика"
We continue to explore the multi-agent logic of computational trees relative to the relational Kripke semantics of possible worlds: we investigate the question of logical solvability, the complexity of model construction, feasibility testing, and ...
S.I. Bashmakov, K. A. Smelykh
doaj   +1 more source

Kripke Semantics for BL0 and BL – Technical report [PDF]

open access: yes, 2017
We describe Kripke semantics for the access control logics BL0 and BL, developed by Garg and ...
Garg, Deepak, CRAMER, Marcos
core   +1 more source

Home - About - Disclaimer - Privacy