{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:40:03Z","timestamp":1706650803192},"reference-count":16,"publisher":"Duke University Press","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[1995,4,1]]},"DOI":"10.1305\/ndjfl\/1040248461","type":"journal-article","created":{"date-parts":[[2003,2,25]],"date-time":"2003-02-25T21:30:24Z","timestamp":1046208624000},"source":"Crossref","is-referenced-by-count":4,"title":["Decidability and Completeness for Open Formulas of Membership Theories"],"prefix":"10.1215","volume":"36","author":[{"given":"Dorella","family":"Bell\u00e8","sequence":"first","affiliation":[]},{"given":"Franco","family":"Parlamento","sequence":"additional","affiliation":[]}],"member":"73","reference":[{"key":"1","unstructured":"Aczel, P., Non-W<\/i>ell-Founded Sets, CSLI Lecture Notes, 1988. Zbl 0668.04001 MR 89j:03039"},{"key":"2","unstructured":"Bell\u00e8, D., and F. Parlamento, \u201cDeciding unquantified formulae in weak membership theories,\u201d Technical Report 14\/92, Universit\u00e0 di Udine, 1992."},{"key":"3","doi-asserted-by":"publisher","unstructured":"Breban, M., A. Ferro, E. Omodeo and J. T. Schwartz, \u201cDecision procedures for elementary sublanguages of set theory II: formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions,\u201d Communications on Pure and Applied Mathematics<\/i>, vol. 34 (1981), pp. 177\u2013195. Zbl 0465.03003 MR 82i:03018b","DOI":"10.1002\/cpa.3160340203"},{"key":"4","doi-asserted-by":"crossref","unstructured":"Collins, G. E., and J. D. Halpern, \u201cOn the interpretability of arithmetic in set theory,\u201d Notre Dame Journal of Formal Logic<\/i>, vol. 11 (1970), pp. 477\u2013483. Zbl 0185.01601 MR 45:4970","DOI":"10.1305\/ndjfl\/1093894080"},{"key":"5","unstructured":"Dreben, B., and W. D. Goldfarb, The D<\/i>ecision Problem. Solvable Classes of Quantificational Formulas, Addison Wesley, Reading, 1979. Zbl 0457.03005 MR 81i:03015"},{"key":"6","unstructured":"Lewis H. R., U<\/i>nsolvable Classes of Quantificational Formulas, Addison Wesley, Reading, 1979. Zbl 0423.03003 MR 81i:03069"},{"key":"7","doi-asserted-by":"crossref","unstructured":"Montagna, F., and A. Mancini, \u201cA minimal predicative set theory,\u201d Notre Dame Journal of Formal Logic<\/i>, vol. 35 (1994), pp. 186\u2013203. Zbl 0816.03023 MR 95h:03117","DOI":"10.1305\/ndjfl\/1094061860"},{"key":"8","unstructured":"Omodeo, E., F. Parlamento and A. Policriti, \u201cDecidability of $\\exists^* \\forall$-sentences in membership theories,\u201d Mathematical Logic Quarterly<\/i>, forthcoming. Zbl 0836.03011 MR 97c:03036"},{"key":"9","doi-asserted-by":"publisher","unstructured":"Parlamento, F., and A. Policriti, \u201cDecision procedures for elementary sublanguages of set theory XIII: model graphs, reflection and decidability,\u201d Journal of A<\/i>utomated Reasoning, vol. 7 (1991), pp. 271\u2013284. Zbl 0734.03006 MR 92j:03008","DOI":"10.1007\/BF00243810"},{"key":"10","doi-asserted-by":"crossref","unstructured":"Parlamento, F., and A. Policriti, \u201cExpressing infinity without foundation,\u201d The Journal of S<\/i>ymbolic Logic, vol 56 (1991), pp. 1230\u20131235. Zbl 0744.03051 MR 93a:03052","DOI":"10.2307\/2275470"},{"key":"11","doi-asserted-by":"crossref","unstructured":"Parlamento, F., and A. Policriti, \u201cThe decision problem for restricted universal quantification in set theory and the axiom of foundation,\u201d Zeitschrift f\u00fcr<\/i> Mathematische Logik und Grundlangen der Mathematik, vol. 38 (1992), pp. 143\u2013156. Zbl 0794.03016 MR 95c:03029","DOI":"10.1002\/malq.19920380110"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Parlamento, F., and A. Policriti, \u201cUndecidability results for restricted universally quantified formulae of set theory,\u201d Communication on P<\/i>ure and Applied Mathematics, vol. 46 (1993), pp. 57\u201373. Zbl 0797.03005 MR 94d:03088","DOI":"10.1002\/cpa.3160460104"},{"key":"13","unstructured":"Parlamento, F., A. Policriti and K. P. S. B. Rao, \u201cWitnessing differences without redundancies,\u201d Technical Report 23\/93, Universit\u00e1 di Udine, 1993. Zbl 0857.03027 MR 97d:04003"},{"key":"14","unstructured":"Tarski, A., and W. Szmielew, \u201cMutual interpretability of some essentially undecidable theories,\u201d p. 734 in Proceedings of the International Congress of Mathematicians<\/i>, vol. 1, Cambridge University Press, Cambridge, 1950."},{"key":"15","unstructured":"Tarski, A., A. Mostowsky and R. M. Robinson, U<\/i>ndecidable Theories, North-Holland, Amsterdam, 1953. Zbl 0053.00401 MR 15,384h"},{"key":"16","unstructured":"Ville, F., \u201cDecidabilit\u00e9 des formules existentielles en theorie des ensembles,\u201d pp. 513\u2013516 in C. R. Acad. Sc. Paris<\/i>, 1971. Zbl 0218.02044 MR 43:4659"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1305\/ndjfl\/1040248461","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:12:30Z","timestamp":1706649150000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-36\/issue-2\/Decidability-and-Completeness-for-Open-Formulas-of-Membership-Theories\/10.1305\/ndjfl\/1040248461.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4,1]]},"references-count":16,"journal-issue":{"issue":"2","published-online":{"date-parts":[[1995,4,1]]}},"URL":"https:\/\/doi.org\/10.1305\/ndjfl\/1040248461","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4,1]]}}}