Results 81 to 90 of about 1,681 (204)
Monadic Second Order Logic And Its Fragments
Electronic Notes in Theoretical Computer Science, 2002 AbstractVarious recent results about monadic second order logic and its fragments are presented. These results have been obtained in the framework of the EU TMR Project GETGRATS.
openaire +1 more source
Qua‐Talk and Other Forms of Quackery: Part One
Philosophy Compass, Volume 20, Issue 11, November 2025.ABSTRACT The Latin term “qua” is used occasionally in ordinary discourse but more often as a philosophical term of art. Its purpose is sometimes to avoid what would otherwise be contradictions, as in “necessarily two‐legged qua cyclist, contingently two‐legged qua mathematician.” In this paper, I identify and clarify several of the philosophical uses ...
James Van Cleve
wiley +1 more source
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity [PDF]
Logical Methods in Computer Science, 2019 This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighborhood diversity.
Dušan Knop +3 more
doaj +1 more source
In defense of value incomparability: A reply to Dorr, Nebel, and Zuehl
Noûs, Volume 59, Issue 3, Page 796-808, September 2025.Abstract Cian Dorr, Jacob Nebel, and Jake Zuehl have argued that no objects are incomparable in value. One set of arguments they offer depart from a principle they call ‘Strong Monotonicity’, which states that if x is good and y is not good, then x is better than y.
Erik Carlson, Olle Risberg
wiley +1 more source
The Contingent Spotlight Theory
Pacific Philosophical Quarterly, Volume 106, Issue 3, Page 162-172, September 2025.ABSTRACT In this paper I defend the Contingent Spotlight Theory, a theory of modality analogous to the Moving Spotlight Theory in the philosophy of time. My defence of the theory consists in developing responses to three objections that have been raised against it, two of which are due to Lewis (1986).
Daniel Deasy
wiley +1 more source
Process and individuation (on speculative realism and becoming)
The Southern Journal of Philosophy, Volume 63, Issue 3, Page 410-428, September 2025.Abstract Recent developments in the continental tradition have taken a realist turn that reveals an oscillation between, on the one hand, an ontology of virtuality that thinks of reality as process and continuum (albeit a continuum of differences or events) and, on the other hand, the resurgence of an ontology of objects and essences guided by the ...
Pascal Massie
wiley +1 more source
Mosel: A flexible toolset for monadic second-order logic [PDF]
, 1997 Mosel is a new tool-set for the analysis and verification in Monadic Second-order Logic. In this paper we concentrate on the system's design: Mosel is a tool-set to include a flexible set of decision procedures for several theories of the logic complemented by a variety of support components for input format translations, visualization, and interfaces ...
Peter Kelb +3 more
openaire +1 more source
The Parameterized Complexity of Learning Monadic Second-Order Logic
, 2023 Within the model-theoretic framework for supervised learning introduced by Grohe and Turán (TOCS 2004), we study the parameterized complexity of learning concepts definable in monadic second-order logic (MSO). We show that the problem of learning an MSO-definable concept from a training sequence of labeled examples is fixed-parameter tractable on ...
Steffen van Bergerem +2 more
openaire +4 more sources
Food Science &Nutrition, Volume 13, Issue 8, August 2025.The advantages and limitations of standard ranking techniques are evaluated. Related methodologies from other disciplines have the potential to sensory studies. International food competition rules are heterogeneous and insufficiently specified. Guidance for future research directions in decision methodologies is provided.
László Sipos +4 more
wiley +1 more source
Expressing cardinality quantifiers in monadic second-order logic over chains
, 2020 . 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 ...
Łukasz Kaiser +2 more
core