Results 11 to 20 of about 1,478 (181)
The expressive power of modal logic with inclusion atoms [PDF]
Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete characterisation for the
Lauri Hella, Johanna Stumpf
doaj +1 more source
Given a Kripke structure M and CTL formula $\varphi$, where M does not satisfy $\varphi$, the problem of Model Repair is to obtain a new model M' such that M' satisfies $\varphi$.
George Chatzieleftheriou +3 more
doaj +1 more source
Faithful Modeling of Product Lines with Kripke Structures and Modal Logic [PDF]
Software product lines are now an established framework for software design. They are specified by special diagrams called feature models. For formal analysis, the latter are usually encoded by Boolean propositional theories.
Z. Diskin +3 more
doaj +1 more source
Conditional Belief, Knowledge and Probability [PDF]
A natural way to represent beliefs and the process of updating beliefs is presented by Bayesian probability theory, where belief of an agent a in P can be interpreted as a considering that P is more probable than not P. This paper attempts to get at the
Jan van Eijck, Kai Li
doaj +1 more source
An Arithmetically Complete Predicate Modal Logic
This paper investigates a first-order extension of GL called \(\textup{ML}^3\). We outline briefly the history that led to \(\textup{ML}^3\), its key properties and some of its toolbox: the \emph{conservation theorem}, its cut-free Gentzenisation, the ...
Yunge Hao, George Tourlakis
doaj +1 more source
Toward a New Theory of Moderate Contingentism: Individuals just are Realized Essences
In this paper, we propose a new actualist and contingentist modal metaphysics – fundamental essentialism – according to which individuals just are realized essences.
Pranciškus Gricius
doaj +1 more source
Kripke Semantics for Martin-L\"of's Extensional Type Theory [PDF]
It is well-known that simple type theory is complete with respect to non-standard set-valued models. Completeness for standard models only holds with respect to certain extended classes of models, e.g., the class of cartesian closed categories. Similarly,
Steve Awodey, Florian Rabe
doaj +1 more source
Type Directed Partial Evaluation for Level-1 Shift and Reset [PDF]
We present an implementation in the Coq proof assistant of type directed partial evaluation (TDPE) algorithms for call-by-name and call-by-value versions of shift and reset delimited control operators, and in presence of strong sum types.
Danko Ilik
doaj +1 more source
A Weakly Initial Algebra for Higher-Order Abstract Syntax in Cedille [PDF]
Cedille is a relatively recent tool based on a Curry-style pure type theory, without a primitive datatype system. Using novel techniques based on dependent intersection types, inductive datatypes with their induction principles are derived. One benefit
Aaron Stump
doaj +1 more source
Logic-Sensitivity of Aristotelian Diagrams in Non-Normal Modal Logics
Aristotelian diagrams, such as the square of opposition, are well-known in the context of normal modal logics (i.e., systems of modal logic which can be given a relational semantics in terms of Kripke models). This paper studies Aristotelian diagrams for
Lorenz Demey
doaj +1 more source

