Results 11 to 20 of about 164,088 (328)
Loop-check free sequent calculi for unary fragment of temporal logic
Lietuvos Matematikos RinkinysThis paper explores the construction of an efficient sequent calculus for a selected fragment of porpositional linear temporal logic (PLTL), extending the ideas of classical calculi discussed in [1], and builds upon previous investigations into the ...
Lukas Maksimiak, Adomas Birštunas
doaj +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
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 +1 more source
Formal language theory of logic fragments
, 2014 The present thesis consists of two parts. Based on syntactic closure axioms of formula sets, the first part gives a formal definition of logic fragments. It also shows the versatileness of this notion of logic fragments, inter alia, giving, C-variety descriptions of logic fragments and abstractly investigating the influence of certain predicates on the
Alexander Lauser
openalex +4 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
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.
Balan, Adriana +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
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
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