Results 221 to 230 of about 101,814 (276)
Expressivity of extensions of dynamic predicate logic
ten Cate, B.D.+2 more
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Van Benthem/Rosen theorem for coalgebraic predicate logic
Journal of Logic and Computation, 2015A BSTRACT . Coalgebraic modal logic serves as a unifying framework to study a wide range of modal logics beyond the relational realm, including probabilistic and graded logics as well as conditional logics and logics based on neighbourhoods and games ...
Lutz Schröder+2 more
semanticscholar +1 more source
Regular Expressions and Predicate Logic in Finite-State Language Processing
Finite-State Methods and Natural Language Processing, 2009This paper proposes an extension to the formalism of regular expressions with a form of predicate logic where quantified propositions apply to substrings.
Mans Hulden
semanticscholar +1 more source
Kripke incompleteness of predicate extensions of the modal logics axiomatized by a canonical formula for a frame with a nontrivial cluster [PDF]
The author generalizes the Kripke incompleteness proof for predicate modal logic presented in \textit{G. E. Hughes} and \textit{M. J. Cresswell}'s book ``A new introduction to modal logic'' (Routledge, London) (1996; Zbl 0855.03002), and shows the incompleteness for some predicate modal logics in the extensions of S4 characterized by means of the frame
openaire +1 more source
The Effects of Adding Reachability Predicates in Propositional Separation Logic
Foundations of Software Science and Computation Structure, 2018The list segment predicate \(\mathtt {ls}\) used in separation logic for verifying programs with pointers is well-suited to express properties on singly-linked lists.
Stephane Demri+2 more
semanticscholar +1 more source
A Modal Logic of a Truth Definition for Finite Models
Fundamenta Informaticae, 2019The property of being true in almost all finite, initial segments of the standard model of arithmetic is ∑ 2 0 –complete. Thus, it admits a kind of a truth definition. We define such an arithmetical predicate. Then, we define its modal logic SL and prove
M. Czarnecki, K. Zdanowski
semanticscholar +1 more source
A completeness theorem for continuous predicate modal logic
Archive for Mathematical Logic, 2019S. Baratella
semanticscholar +1 more source