On the computational complexity of the numerically definite syllogistic and related logics

Bulletin of Symbolic Logic 14 (1):1-28 (2008)
Abstract
The numerically definite syllogistic is the fragment of English obtained by extending the language of the classical syllogism with numerical quantifiers. The numerically definite relational syllogistic is the fragment of English obtained by extending the numerically definite syllogistic with predicates involving transitive verbs. This paper investigates the computational complexity of the satisfiability problem for these fragments. We show that the satisfiability problem (= finite satisfiability problem) for the numerically definite syllogistic is strongly NP-complete, and that the satisfiability problem (= finite satisfiability problem) for the numerically definite relational syllogistic is NEXPTIME-complete, but perhaps not strongly so. We discuss the related problem of probabilistic (propositional) satisfiability, and thereby demonstrate the incompleteness of some proof-systems that have been proposed for the numerically definite syllogistic
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 10,316
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA
Ian Pratt-Hartmann (2013). The Syllogistic with Unity. Journal of Philosophical Logic 42 (2):391-407.
Similar books and articles
Ian Pratt-Hartmann (2004). Fragments of Language. Journal of Logic, Language and Information 13 (2):207-223.
Ian Pratt-Hartmann (2013). The Syllogistic with Unity. Journal of Philosophical Logic 42 (2):391-407.
Volker Weber (2009). Branching-Time Logics Repeatedly Referring to States. Journal of Logic, Language and Information 18 (4):593-624.
Erich Grädel (1999). On the Restraining Power of Guards. Journal of Symbolic Logic 64 (4):1719-1742.
Lawrence S. Moss (2011). Syllogistic Logic with Comparative Adjectives. Journal of Logic, Language and Information 20 (3):397-417.
Analytics

Monthly downloads

Added to index

2010-08-30

Total downloads

3 ( #271,070 of 1,096,449 )

Recent downloads (6 months)

1 ( #231,754 of 1,096,449 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.