- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Complexity of the two-variable fragment with counting quantifiers
Journal of Logic, Language and Information 14 (3):369-395 (2005)
Abstract
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.Author's Profile
Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
The two‐variable fragment with counting and equivalence.Ian Pratt-Hartmann - 2015 - Mathematical Logic Quarterly 61 (6):474-515.
A Double Team Semantics for Generalized Quantifiers.Antti Kuusisto - 2015 - Journal of Logic, Language and Information 24 (2):149-191.
An Event-Based Fragment of First-Order Logic over Intervals.Savas Konur - 2011 - Journal of Logic, Language and Information 20 (1):49-68.
First-order and counting theories of ω-automatic structures.Dietrich Kuske & Markus Lohrey - 2008 - Journal of Symbolic Logic 73 (1):129-150.
Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations.Christopher Hampson, Stanislav Kikot, Agi Kurucz & Sérgio Marcelino - 2020 - Annals of Pure and Applied Logic 171 (5):102786.
Dependence Logic with a Majority Quantifier.Arnaud Durand, Johannes Ebbing, Juha Kontinen & Heribert Vollmer - 2015 - Journal of Logic, Language and Information 24 (3):289-305.
On the computational complexity of the numerically definite syllogistic and related logics.Ian Pratt-Hartmann - 2008 - Bulletin of Symbolic Logic 14 (1):1-28.
The guarded fragment with transitive guards.Wiesław Szwast & Lidia Tendera - 2004 - Annals of Pure and Applied Logic 128 (1-3):227-276.
Fragments of language.Ian Pratt-Hartmann - 2004 - Journal of Logic, Language and Information 13 (2):207-223.
Analytics
Added to PP
2009-01-28
Downloads
120 (#389,352)
6 months
21 (#525,211)
2009-01-28
Downloads
120 (#389,352)
6 months
21 (#525,211)
Historical graph of downloads
Author's Profile
Citations of this work
Combining answer set programming with description logics for the Semantic Web.Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer & Hans Tompits - 2008 - Artificial Intelligence 172 (12-13):1495-1539.
A Double Team Semantics for Generalized Quantifiers.Antti Kuusisto - 2015 - Journal of Logic, Language and Information 24 (2):149-191.
Counting in Goodman and Quine’s constructive nominalism.Alexander R. Pruss & Emil Jeřábek - 2026 - Synthese 207 (1):52.
Expressive probabilistic description logics.Thomas Lukasiewicz - 2008 - Artificial Intelligence 172 (6-7):852-883.
On the computational complexity of the numerically definite syllogistic and related logics.Ian Pratt-Hartmann - 2008 - Bulletin of Symbolic Logic 14 (1):1-28.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation