Results 21 to 30 of about 155,122 (304)
Lindstrom theorems for fragments of first-order logic [PDF]
Logical Methods in Computer Science, 2007 Lindstr\"om theorems characterize logics in terms of model-theoretic conditions such as Compactness and the L\"owenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic. But on the other hand, many logics relevant to computer science are fragments or extensions of fragments of first-order logic, e.g.,
Balder ten Cate +2 more
openalex +12 more sources
Doing logic by computer: interpolation in fragments of intuitionistic propositional logic
Annals of Pure and Applied Logic, 2000 AbstractIn this paper we study the interpolation property in fragments of intuitionistic and propositional logic, using both proof theoretic and semantic techniques. We will also sketch some computational methods, based on the semantical techniques introduced, to obtain counterexamples in fragment where interpolation (or the stronger property of ...
Lex Hendriks
openalex +5 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
Fragmentation and logical omniscience [PDF]
Noûs, 2021 AbstractIt would be good to have a Bayesian decision theory that assesses our decisions and thinking according to everyday standards of rationality—standards that do not require logical omniscience (Garber, 1983; Hacking, 1967). To that end we develop a “fragmented” decision theory in which a single state of mind is represented by a family of credence ...
Adam Elga, Agustín Rayo
openaire +2 more sources
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 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
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
Making first order linear logic a generating grammar [PDF]
Logical Methods in Computer Science, 2023 It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type calculus (ETTC)
Sergey Slavnov
doaj +1 more source
A Real-Valued Modal Logic [PDF]
Logical Methods in Computer Science, 2018 A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers.
Denisa Diaconescu +2 more
doaj +1 more source
Relation-Changing Logics as Fragments of Hybrid Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 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
Mauricio Martel +3 more
openaire +5 more sources