Results 61 to 70 of about 200,339 (137)
The succinctness of first-order logic on linear orders [PDF]
, 2011 Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of (approximately) the ...
Grohe, Martin, Schweikardt, Nicole
core
An Efficient Algorithm for Monitoring Practical TPTL Specifications
, 2016 We provide a dynamic programming algorithm for the monitoring of a fragment of Timed Propositional Temporal Logic (TPTL) specifications. This fragment of TPTL, which is more expressive than Metric Temporal Logic, is characterized by independent time ...
Dokhanchi, Adel +3 more
core +1 more source
Relating Reasoning Methodologies in Linear Logic and Process Algebra [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We show that the proof-theoretic notion of logical preorder coincides with the process-theoretic notion of contextual preorder for a CCS-like calculus obtained from the formula-as-process interpretation of a fragment of linear logic.
Yuxin Deng +2 more
doaj +1 more source
Moving up and down in the generic multiverse
, 2012 We give a brief account of the modal logic of the generic multiverse, which is a bimodal logic with operators corresponding to the relations "is a forcing extension of" and "is a ground model of".
G. Fuchs +13 more
core +3 more sources
Lietuvos Matematikos Rinkinys, 2009 The paper deals with specialization of the antecedent negation loop-rule for the negative implication free fragment of the propositional intuitionistic logic.
Romas Alonderis
doaj +1 more source
Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras [PDF]
, 2015 Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor.
Enqvist, Sebastian +2 more
core +3 more sources
The Systems of Relevance Logic [PDF]
Argument, 2011 The system R, or more precisely the pure implicational fragment R→, is considered by the relevance logicians as the most important. The another central system of relevance logic has been the logic E of entailment that was supposed to capture strict ...
Ryszard MIREK
doaj
Craig Interpolation for Decidable First-Order Fragments [PDF]
arXiv, 2023 We show that the guarded-negation fragment is, in a precise sense, the smallest extension of the guarded fragment with Craig interpolation. In contrast, we show that full first-order logic is the smallest extension of both the two-variable fragment and the forward fragment with Craig interpolation. Similarly, we also show that all extensions of the two-
arxiv
Relation-Changing Logics as Fragments of Hybrid Logics [PDF]
EPTCS 226, 2016, pp. 16-29, 2016 Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to delete, add, and swap edges in the model, both locally and globally. We provide translations from these logics to
arxiv +1 more source
Deciding regular grammar logics with converse through first-order logic
, 2003 We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF2, which is the intersection of the guarded fragment and the 2-variable fragment of first-order logic.
de Nivelle, Hans, Demri, Stephane
core +4 more sources