Results 61 to 70 of about 62,255 (228)
Noûs, EarlyView.ABSTRACT It is a truism of mathematics that differences between isomorphic number systems are irrelevant to arithmetic. This truism is deeply rooted in the modern axiomatic method and underlies most strands of arithmetical structuralism, the view that arithmetic is about some abstract number structure.
Balthasar Grabmayr
wiley +1 more source
Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers
, 2004 We show that the satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.Comment: 24 pages, 1 pstex_t ...
Pratt-Hartmann, Ian
core +2 more sources
The Southern Journal of Philosophy, EarlyView.Abstract This article reinterprets Levinas's account of ethical subjectivity by centering the temporality of the pas encore (“not yet”) and drawing on new materials in Œuvres complètes. I argue that, in Totality and Infinity, eros and ethics are internally continuous: eros generates a responsible not yet of time, secured by fecundity and oriented to ...
Huaiyuan Zhang
wiley +1 more source
Two-Variable Logic with Two Order Relations [PDF]
Logical Methods in Computer Science, 2012 It is shown that the finite satisfiability problem for two-variable logic over structures with one total preorder relation, its induced successor relation, one linear order relation and some further unary relations is EXPSPACE-complete.
Thomas Schwentick, Thomas Zeume
doaj +1 more source
International Journal of Apllied Mathematics, 2016 We define a satisfiability tree in the context of classical propositional logic. Satisfiability tree is a structure inspired by the Beth’s semantic tableau, later refined into its modern variant by Lis and Smullyan and by the notion that tableau is a tree-like representation of a formula.
openaire +3 more sources
Making desires satisfied, making satisfied desires
Philosophical Studies, 2023 AbstractIn this paper, I explore a fundamental but under-appreciated distinction between two ways of understanding the desire-satisfaction theory of well-being. According to proactive desire satisfactionism, a person is benefited by the acquisition of new satisfied desires. According to reactive desire satisfactionism, a person can be benefited only by
openaire +1 more source
Theoria, EarlyView.Abstract This paper argues for the significance of Kaplan's logic LD in two ways: first, by looking at how logic got along before we had LD, and second, by using it to bring out the similarity between David Hume's thesis that one cannot deduce claims about the future on the basis of premises only about the past, and the so‐called "essentiality" of the ...
Gillian Russell
wiley +1 more source
, 2014 We develop a sound, complete and practically implementable tableaux-based decision method for constructive satisfiability testing and model synthesis in the fragment ATL+ of the full Alternating time temporal logic ATL*.
A. David +7 more
core +6 more sources
(Co‐)Reference All the Way Down: A Unified Theory of (Pro) Nominals in Ordinary English
Theoria, EarlyView.ABSTRACT This essay joins two themes, both arising from Kripke's inspiring ideas in the theory of reference. The first theme concerns reference in general. The second examines the notion of co‐reference and the role it plays in a unified theory of pronouns for natural language.
Jessica Pepp, Joseph Almog
wiley +1 more source
Model-Checking Problems as a Basis for Parameterized Intractability [PDF]
Logical Methods in Computer Science, 2005 Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form.
Joerg Flum, Martin Grohe
doaj +1 more source