{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T21:55:27Z","timestamp":1777067727026,"version":"3.51.4"},"reference-count":20,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":6493,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1996,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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 <jats:italic>fluted<\/jats:italic>. 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.<\/jats:p>","DOI":"10.2307\/2275678","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T22:58:29Z","timestamp":1146956309000},"page":"608-620","source":"Crossref","is-referenced-by-count":17,"title":["Fluted formulas and the limits of decidability"],"prefix":"10.1017","volume":"61","author":[{"given":"William C.","family":"Purdy","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S002248120001745X_ref017","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-3763-5_2"},{"key":"S002248120001745X_ref006","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-3296-4_8"},{"key":"S002248120001745X_ref007","volume-title":"Logic, language-games and information","author":"Hintikka","year":"1973"},{"key":"S002248120001745X_ref002","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9455-6"},{"key":"S002248120001745X_ref020","first-page":"21","volume-title":"Language, mind, and brain","author":"Suppes","year":"1982"},{"key":"S002248120001745X_ref011","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-1152-2_3"},{"key":"S002248120001745X_ref008","first-page":"337","volume-title":"Logical foundations of logical programming","author":"Huet","year":"1990"},{"key":"S002248120001745X_ref019","doi-asserted-by":"publisher","DOI":"10.1007\/BF00246025"},{"key":"S002248120001745X_ref001","volume-title":"An introduction to mathematical logic and type theory","author":"Andrews","year":"1986"},{"key":"S002248120001745X_ref014","volume-title":"The ways of paradox and other essays","author":"Quine","year":"1976"},{"key":"S002248120001745X_ref013","volume-title":"Proceedings of the 14th international congress of philosophy","volume":"3","author":"Quine","year":"1969"},{"key":"S002248120001745X_ref018","first-page":"11","volume-title":"The new syllogistic","author":"Sommers","year":"1987"},{"key":"S002248120001745X_ref004","volume-title":"Logic for computer science","author":"Gallier","year":"1986"},{"key":"S002248120001745X_ref016","volume-title":"Methods of logic","author":"Quine","year":"1982"},{"key":"S002248120001745X_ref003","volume-title":"A mathematical introduction to logic","author":"Enderton","year":"1972"},{"key":"S002248120001745X_ref009","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1093883255"},{"key":"S002248120001745X_ref005","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-7633-9"},{"key":"S002248120001745X_ref015","first-page":"649","volume":"46","author":"Quine","year":"1981","journal-title":"Predicate functors revisited"},{"key":"S002248120001745X_ref012","first-page":"343","article-title":"Variables explained away","volume":"104","author":"Quine","year":"1960","journal-title":"Proceedings of the American Philosophical Society"},{"key":"S002248120001745X_ref010","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1093635837"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S002248120001745X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T21:29:11Z","timestamp":1557696551000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S002248120001745X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["S002248120001745X"],"URL":"https:\/\/doi.org\/10.2307\/2275678","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}