Results 51 to 60 of about 1,681 (204)
Expressing Cardinality Quantifiers in Monadic Second−Order Logic over Trees
, 2010 We study an extension of monadic second-order logic of order with the uncountability quantifier ``there exist uncountably many sets''. We prove that, over the class of finitely branching trees, this extension is equally expressive to plain monadic second-
Barany, Vince +2 more
core +2 more sources
Monadic Second Order Finite Satisfiability and Unbounded Tree-Width [PDF]
, 2016 The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese.
Veith, Helmut +2 more
core +1 more source
On the First-Order Complexity of Induced Subgraph Isomorphism [PDF]
Logical Methods in Computer Science, 2019 Given a graph $F$, let $I(F)$ be the class of graphs containing $F$ as an induced subgraph. Let $W[F]$ denote the minimum $k$ such that $I(F)$ is definable in $k$-variable first-order logic.
Oleg Verbitsky, Maksim Zhukovskii
doaj +1 more source
Monadic second order logic as the model companion of temporal logic [PDF]
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016 22 pp. (10 pp. + 12 pp. appendix).
S. Ghilardi, S. van Gool
openaire +3 more sources
Randomisation and Derandomisation in Descriptive Complexity Theory [PDF]
Logical Methods in Computer Science, 2011 We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the complexity class BPP ...
Kord Eickmeyer, Martin Grohe
doaj +1 more source
The tree width of auxiliary storage [PDF]
, 2011 We propose a generalization of results on the decidability of emptiness for several restricted classes of sequential and distributed automata with auxiliary storage (stacks, queues) that have recently been proved.
Parlato, Gennaro +3 more
core +1 more source
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA [PDF]
Logical Methods in Computer Science, 2006 Modal formulae express monadic second-order properties on Kripke frames, but in many important cases these have first-order equivalents. Computing such equivalents is important for both logical and computational reasons.
Willem Conradie +2 more
doaj +1 more source
Monadic Second-Order Logic of Permutations
CoRRPermutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and Féray, who studied the expressibility of first-order logic in this setting. We focus our attention on monadic second-order logic.
Vít Jelínek, Michal Opler
openaire +2 more sources
Monadic second-order incorrectness logic for GP 2
Journal of Logical and Algebraic Methods in Programming, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christopher M. Poskitt, Detlef Plump
openaire +2 more sources
Noûs, EarlyView.ABSTRACT Purity is the principle that fundamental facts only have fundamental constituents. In recent years, it has played a significant (if sometimes implicit) role in metaphysical theorizing. A philosopher will argue that a fact [p]$[p]$ contains a derivative entity and cite Purity as a reason to deny that [p]$[p]$ is fundamental. I argue that recent
Samuel Z. Elgin
wiley +1 more source