Results 11 to 20 of about 1,821,618 (323)
Finite Model Theory of the Triguarded Fragment and Related Logics [PDF]
Logic in Computer Science, 2021 The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments without equality.
Emanuel Kieroński, Sebastian Rudolph
openalex +3 more sources
How big is BCI fragment of BCK logic [PDF]
Journal of Logic and Computation, 2011 We investigate quantitative properties of BCI and BCK logics. The first part of the article compares the number of formulas provable in BCI versus BCK logics. We consider formulas built on implication and a fixed set of k variables.
Katarzyna Grygiel +2 more
openalex +3 more sources
The Triguarded Fragment of First-Order Logic
Logic Programming and Automated Reasoning, 2018 Sebastian Rudolph, Mantas Šimkus
openalex +3 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
A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic [PDF]
Journal of Logic and Computation, 2005 Lev D. Beklemishev +2 more
openalex +2 more sources
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
On a Convex Logic Fragment for Learning and Reasoning [PDF]
IEEE transactions on fuzzy systems, 2018 In this paper, we introduce the convex fragment of Łukasiewicz logic and discuss its possible applications in different learning schemes. The provided theoretical results are highly general because they can be exploited in any learning framework ...
Francesco Giannini +3 more
semanticscholar +1 more source
A Temporal Logic for Asynchronous Hyperproperties [PDF]
International Conference on Computer Aided Verification, 2021 Hyperproperties are properties of computational systems that require more than one trace to evaluate, e.g., many information-flow security and concurrency requirements. Where a trace property defines a set of traces, a hyperproperty defines a set of sets
Jan Baumeister +4 more
semanticscholar +1 more source
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