Results 1 to 10 of about 16,441 (253)
A Decidable Fragment of Separation Logic
Lecture Notes in Computer Science, 2004 We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the stylized form of reasoning done in example program proofs. The fragment includes a predicate for describing linked list segments (a kind of reachability or transitive ...
Josh Berdine +2 more
exaly +3 more sources
Decision procedure for a fragment of dynamic logic
Lietuvos Matematikos Rinkinys, 2001 There is not abstract.
Aida Pliuškevičienė
doaj +5 more sources
Negational Fragment of Intuitionistic Control Logic [PDF]
Studia Logica, 2015 Draft, 22 ...
exaly +6 more sources
Modal meet-implication logic [PDF]
Logical Methods in Computer Science, 2022 We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame.
Jim de Groot, Dirk Pattinson
doaj +1 more source
On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics [PDF]
Logical Methods in Computer Science, 2021 We present syntactic characterisations for the union closed fragments of existential second-order logic and of logics with team semantics. Since union closure is a semantical and undecidable property, the normal form we introduce enables the handling and
Matthias Hoelzel, Richard Wilke
doaj +1 more source
On the Succinctness of Atoms of Dependency [PDF]
Logical Methods in Computer Science, 2019 Propositional team logic is the propositional analog to first-order team logic. Non-classical atoms of dependence, independence, inclusion, exclusion and anonymity can be expressed in it, but for all atoms except dependence only exponential translations ...
Martin Lück, Miikka Vilander
doaj +1 more source
Existential Definability over the Subword Ordering [PDF]
Logical Methods in Computer Science, 2023 We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering.
Pascal Baumann +3 more
doaj +1 more source
The succinctness of first-order logic on linear orders [PDF]
Logical Methods in Computer Science, 2005 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 ...
Martin Grohe, Nicole Schweikardt
doaj +1 more source
Positive Fragments of Coalgebraic Logics [PDF]
Logical Methods in Computer Science, 2013 Positive modal logic was introduced in an influential 1995 paper of Dunn as the positive fragment of standard modal logic. His completeness result consists of an axiomatization that derives all modal formulas that are valid on all Kripke frames and are built only from atomic propositions, conjunction, disjunction, box and diamond.
Adriana Balan +2 more
openaire +5 more sources
The Relationship Between Separation Logic and Implicit Dynamic Frames [PDF]
Logical Methods in Computer Science, 2012 Separation logic is a concise method for specifying programs that manipulate dynamically allocated storage. Partially inspired by separation logic, Implicit Dynamic Frames has recently been proposed, aiming at first-order tool support.
Matthew J. Parkinson +1 more
doaj +1 more source