Fluted formulas and the limits of decidability

Journal of Symbolic Logic 61 (2):608-620 (1996)
In the predicate calculus, variables provide a flexible indexing service which selects the actual arguments to a predicate letter from among possible arguments that precede the predicate letter (in the parse of the formula). In the process of selection, the possible arguments can be permuted, repeated (used more than once), and skipped. If this service is withheld, so that arguments must be the immediately preceding ones, taken in the order in which they occur, the formula is said to be fluted. Quine showed that if a fluted formula contains only homogeneous conjunction (conjoins only subformulas of equal arity), then the satisfiability of the formula is decidable. It remained an open question whether the satisfiability of a fluted formula without this restriction is decidable. This paper answers that question
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275678
 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
Our Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 25,136
Through your library
References found in this work BETA
Predicate-Functors and the Limits of Decidability in Logic.Aris Noah - 1980 - Notre Dame Journal of Formal Logic 21 (4):701-707.
A Logic for Natural Language.William C. Purdy - 1991 - Notre Dame Journal of Formal Logic 32 (3):409-425.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

62 ( #79,944 of 2,132,955 )

Recent downloads (6 months)

1 ( #387,667 of 2,132,955 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums