Results 41 to 50 of about 1,478 (181)
On Model Checking Durational Kripke Structures [PDF]
, 2002 We consider quantitative model checking in durational Kripke structures (Kripke structures where transitions have integer durations) with timed temporal logics where subscripts put quantitative constraints on the time it takes before a property is satisfied.We investigate the conditions that allow polynomial-time model checking algorithms for timed ...
François Laroussinie +2 more
openaire +1 more source
The determination of what is said and what is implied
Mind &Language, EarlyView.Is what is said determined by syntax, conventional meaning, and select aspects of context? This thesis—semanticity—seems plausible because what is said can diverge from both what the speaker means and what the addressee understands, and because ordinary speakers know what is said when presented with a novel sentence‐context pair.
Victor Tamburini
wiley +1 more source
A step-indexed Kripke model of hidden state [PDF]
Mathematical Structures in Computer Science, 2012 Frame and anti-frame rules have been proposed as proof rules for modular reasoning about programs. Frame rules allow the hiding of irrelevant parts of the state during verification, whereas the anti-frame rule allows the hiding of local state from the context.We discuss the semantic foundations of frame and anti-frame rules, and present the first sound
Schwinghammer, Jan +5 more
openaire +3 more sources
Noûs, EarlyView.ABSTRACT Causalists contend that you see a specific object (rather than a lookalike, or no object at all) because that object sits at the beginning of an appropriate causal chain that terminates in your visual experience. We argue that neither standard causalists nor their non‐causalist opponents can adequately accommodate a striking asymmetry between ...
Dominic Alford‐Duguid, Umrao Sethi
wiley +1 more source
Computing (bi)simulation relations preserving CTL*x. for ordinary and fair Kripke structures.
Труды Института системного программирования РАН, 2007 The main goal of model checking is to verify whether a model of a given program satisfies some given specification. In this paper models are regarded as fair or ordinary Kripke structures whereas specifications are represented by formulae branching-time ...
P.E. Bulychev +2 more
doaj
Pacific Philosophical Quarterly, EarlyView.ABSTRACT This paper is about the hierarchy view: that each word has infinitely many meanings, arranged into levels, with the level n meaning serving as its semantic value when it occurs embedded to degree n in indirect or attitude reporting verbs. Departing from the famous debates over the bare tenability of the hierarchy view, I focus on whether there
Mark McCullagh
wiley +1 more source
Some Additional Axioms for T-normal Logics. Defining K45, KB4, KD45 and S5 without Using Modal Rules
Bulletin of the Section of LogicThe 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
Potential Infinity, Abstraction Principles and Arithmetic (Leśniewski Style)
Axioms, 2016 This paper starts with an explanation of how the logicist research program can be approached within the framework of Leśniewski’s systems. One nice feature of the system is that Hume’s Principle is derivable in it from an explicit definition of natural ...
Rafal Urbaniak
doaj +1 more source
Now, Again and Again: The Metaphysics of Many Presents
Pacific Philosophical Quarterly, EarlyView.ABSTRACT This paper discusses whether there can be multiple present moments. After presenting some reasons for thinking that the question is worthwhile, I challenge several objections to its possibility: worries about the exclusivity of tense; the nature of change, tense logic and semantics; and the apparent tension between multiple presents and an ...
Nikk Effingham
wiley +1 more source
On Bisimilarity for Quasi-discrete Closure Spaces [PDF]
Logical Methods in Computer ScienceClosure spaces, a generalisation of topological spaces, have shown to be a convenient theoretical framework for spatial model checking. The closure operator of closure spaces and quasi-discrete closure spaces induces a notion of neighborhood akin to that
Vincenzo Ciancia +3 more
doaj +1 more source