Results 61 to 70 of about 1,681 (204)
A Strategy for Dynamic Programs: Start over and Muddle through [PDF]
Logical Methods in Computer Science, 2019 In the setting of DynFO, dynamic programs update the stored result of a query whenever the underlying data changes. This update is expressed in terms of first-order logic.
Samir Datta +4 more
doaj +1 more source
In Defense of Comparability: Reply to Carlson and Risberg
Noûs, EarlyView.ABSTRACT In “The Case for Comparability,” we argue that every comparative expression “F$F$” obeys Comparability: if two things are at least as F$F$ as themselves, then one of them must be at least as F$F$ as the other. One of our arguments appeals to the apparent validity of the Strong Monotonicity schema: x$x$ is F$F$; y$y$ is not F$F$; so, x$x$ is ...
Cian Dorr, Jacob M. Nebel, Jake Zuehl
wiley +1 more source
Lower Bounds for the Complexity of Monadic Second-Order Logic [PDF]
2010 25th Annual IEEE Symposium on Logic in Computer Science, 2010 Preliminary version appeared in proceedings of the 25th IEEE symposium on Logic in Computer Science (LICS'10), Edinburgh, Scotland, UK, pp.
Stephan Kreutzer, Siamak Tazari
openaire +2 more sources
Verifying Graph Programs with Monadic Second-Order Logic [PDF]
, 2021 To verify graph programs in the language GP 2, we present a monadic second-order logic with counting and a Hoare-style proof calculus. The logic has quantifiers for GP 2’s attributes and for sets of nodes or edges. This allows to specify non-local graph properties such as connectedness, k-colourability, etc. We show how to construct a strongest liberal
Wulandari, Gia, Plump, Detlef
openaire +2 more sources
Noûs, EarlyView.ABSTRACT Philosophers often think agency is essentially connected with rationality, intention, or control. However, Minimalists argue that agency is just the power to cause a change; acids and boulders are agents too. Many philosophers treat Minimalism as a wild outlier, assuming its falsity without argument.
William Hornett
wiley +1 more source
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories [PDF]
Logical Methods in Computer Science, 2013 We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007).
Luis Barguñó +4 more
doaj +1 more source
Adorno's empiricism?: On intellectual and metaphysical experience
The Southern Journal of Philosophy, EarlyView.Abstract Adorno's work contains pregnant references to the concepts of both “intellectual” and “metaphysical” experience. While the concept of metaphysical experience figures relatively prominently in the Adorno literature, intellectual experience has been largely neglected—indeed to the point that certain scholars have asserted that the two concepts ...
Tom Whyman
wiley +1 more source
Interval-based Synthesis [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We introduce the synthesis problem for Halpern and Shoham's modal logic of intervals extended with an equivalence relation over time points, abbreviated HSeq.
Angelo Montanari, Pietro Sala
doaj +1 more source
Can we repudiate ontology altogether?
Noûs, Volume 60, Issue 2, Page 264-292, June 2026.Abstract Ontological nihilists repudiate ontology altogether, maintaining that ontological structure is an unnecessary addition to our theorizing. Recent defenses of the view involve a sophisticated combination of highly expressive but ontologically innocent languages combined with a metaphysics of features—non‐objectual, complete but modifiable states
Christopher J. Masterman
wiley +1 more source
Boundedness in languages of infinite words [PDF]
Logical Methods in Computer Science, 2017 We define a new class of languages of $\omega$-words, strictly extending $\omega$-regular languages. One way to present this new class is by a type of regular expressions.
Mikołaj Bojańczyk, Thomas Colcombet
doaj +1 more source