{"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":1706650803206},"reference-count":31,"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\/1040248454","type":"journal-article","created":{"date-parts":[[2003,2,25]],"date-time":"2003-02-25T21:27:49Z","timestamp":1046208469000},"source":"Crossref","is-referenced-by-count":2,"title":["Levels of Truth"],"prefix":"10.1215","volume":"36","author":[{"given":"Andrea","family":"Cantini","sequence":"first","affiliation":[]}],"member":"73","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"Aczel, P., P. Carlisle, and N. Mendler, \u201cTwo frameworks of theories and their implementation in Isabelle,\u201d pp. 5\u201339 in <i>Logical Frameworks<\/i>, edited by G. M. Plotkin et al., Cambridge University Press, Cambridge, 1991. Zbl 0756.03013 MR 1139779","DOI":"10.1017\/CBO9780511569807.003"},{"key":"2","unstructured":"Barendregt, H., <i>The Lambda Calculus: Its Syntax and Semantics<\/i>, North-Holland, Amsterdam, 1984. Zbl 0467.03010 MR 83b:03016"},{"key":"4","doi-asserted-by":"crossref","unstructured":"Burge, T., \u201cSemantical paradox,\u201d <i>Journal of Philosophy<\/i>, vol. 76 (1979), pp. 169-198.","DOI":"10.2307\/2025724"},{"key":"5","unstructured":"Cantini, A., \u201cA note on a predicatively reducible theory of elementary iterated induction,\u201d <i>Bollettino dell'Unione Matematica Italiana<\/i>, vol. 4-b (1985), pp. 413\u2013430. Zbl 0582.03043 MR 87d:03168"},{"key":"6","unstructured":"Cantini, A., \u201cSu una teoria generale delle propriet\u00e0, basata su schemi di comprensione iterati e privi di tipi,\u201d pp. 53\u201357 in <i>Atti degli Incontri di Logica Matematica<\/i>, vol. 3, edited by R. Ferro and A. Zanardo, Cluep, Padova, 1987. Zbl 0628.03017"},{"key":"7","doi-asserted-by":"crossref","unstructured":"Cantini, A., \u201cNotes on formal theories of truth,\u201d <i> Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik<\/i>, vol. 35 (1989), pp. 97\u2013130. Zbl 0661.03043 MR 90e:03073","DOI":"10.1002\/malq.19890350202"},{"key":"8","doi-asserted-by":"publisher","unstructured":"Cantini, A., \u201cA logic of abstraction related to finite constructive number classes,\u201d <i>Archive for Mathematical Logic<\/i>, vol. 31 (1991), pp. 69\u201383. Zbl 0696.03033 MR 92j:03027","DOI":"10.1007\/BF01370695"},{"key":"9","unstructured":"Cantini, A., \u201cLogical frameworks for truth and abstraction,\u201d <i>Studies in Logic<\/i>, vol. 135, North-Holland, Amsterdam, 1995. Zbl 0860.03015 MR 97f:03019"},{"key":"10","doi-asserted-by":"crossref","unstructured":"Devlin, K., \u201cConstructibility\u201d, pp. 453\u2013502 in <i>Handbook of Mathematical Logic<\/i>, edited by J. Barwise, North-Holland, Amsterdam, 1977.","DOI":"10.1016\/S0049-237X(08)71110-8"},{"key":"11","doi-asserted-by":"crossref","unstructured":"Feferman, S., \u201cNon-extensional type-free theories of partial operations and classifications I,\u201d pp. 73\u2013118 in <i>Proof Theory Symposium<\/i>, edited by J. Diller and G. H. M\u00fcller, Springer Lecture Notes in Mathematics, vol. 500, 1974. Zbl 0324.02018 MR 53:10581","DOI":"10.1007\/BFb0079548"},{"key":"12","doi-asserted-by":"crossref","unstructured":"Feferman, S., \u201cIterated inductive fixed point theories: application to Hancock's Conjecture,\u201d pp. 171\u2013195 in <i>Patras Logic Symposion<\/i>, edited by G. Metakides, North-Holland, Amsterdam, 1982. Zbl 0522.03045 MR 84f:03050","DOI":"10.1016\/S0049-237X(08)71364-8"},{"key":"13","doi-asserted-by":"crossref","unstructured":"Feferman, S., \u201cTowards useful type-free theories I,\u201d <i>The Journal of Symbolic Logic<\/i>, vol. 49 (1984), pp. 75\u2013111. MR 85i:03068","DOI":"10.2307\/2274093"},{"key":"14","doi-asserted-by":"crossref","unstructured":"Feferman, S., \u201cReflecting on incompleteness,\u201d <i>The Journal of Symbolic Logic<\/i>, vol. 56 (1991), pp. 1\u201349. Zbl 0746.03046 MR 93b:03097","DOI":"10.2307\/2274902"},{"key":"15","unstructured":"Fitch, F. B., \u201cUniversal metalanguages in philosophy,\u201d <i>Review of Metaphysics<\/i>, vol. 17 (1964), pp. 396\u2013402."},{"key":"16","doi-asserted-by":"crossref","unstructured":"Friedman, H., K. McAloon, and S. G. Simpson, \u201cA finite combinatorial statement which is equivalent to 1-consistency of predicative analysis,\u201d pp. 197\u2013230 in <i>Patras Logic Symposion Logic<\/i>, edited by G. Metakides, North-Holland, Amsterdam, 1982.","DOI":"10.1016\/S0049-237X(08)71365-X"},{"key":"17","doi-asserted-by":"crossref","unstructured":"Gaifman, H., \u201cParadoxes of infinity and self applications I,\u201d <i>Erkenntnis,<\/i> vol. 20 (1983), pp. 131\u2013155.","DOI":"10.1007\/BF00153956"},{"key":"18","doi-asserted-by":"crossref","unstructured":"Girard, J. Y., \u201cA survey of $\\Pi _2^1$-logic,\u201d pp. 89\u2013107 in <i>Logic, Methodology and Philosophy of Science VI<\/i>, edited by L. Cohen, J. Los, H. Pfeiffer, and K. P. Podewski, North-Holland, Amsterdam, 1982. Zbl 0496.03038 MR 84e:03073","DOI":"10.1016\/S0049-237X(09)70184-3"},{"key":"19","doi-asserted-by":"crossref","unstructured":"Gordeev, L., \u201cProof theoretic analysis: weak systems of functions and sets,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 38 (1989), pp. 1\u2013121.","DOI":"10.1016\/0168-0072(88)90055-3"},{"key":"20","doi-asserted-by":"crossref","unstructured":"Hinman, P., <i>Recursion-theoretic Hierarchies<\/i>, Springer-Verlag, Berlin, 1978. Zbl 0371.02017 MR 82b:03084","DOI":"10.1007\/978-3-662-12898-5"},{"key":"21","doi-asserted-by":"crossref","unstructured":"J\u00e4ger, G., \u201cThe strength of admissibility without foundation,\u201d <i>The Journal of Symbolic Logic<\/i>, vol. 49 (1984), pp. 867\u2013879. Zbl 0585.03032 MR 86m:03090","DOI":"10.2307\/2274140"},{"key":"22","doi-asserted-by":"crossref","unstructured":"Kripke, S., \u201cOutline of a theory of truth,\u201d$\\;$ <i>Journal of Philosophy<\/i>,$\\;$ vol. 72 (1975),$\\;$ pp. 690\u2013716. Zbl 0952.03513","DOI":"10.2307\/2024634"},{"key":"23","doi-asserted-by":"crossref","unstructured":"Lorenzen, P., and J. Myhill, \u201cConstructive definitions of certain analytic sets of numbers,\u201d <i>The Journal of Symbolic Logic<\/i>, vol. 24 (1959), pp. 37\u201349. MR 22:14","DOI":"10.2307\/2964572"},{"key":"24","unstructured":"Martin-L\u00f6f, P., <i>Intuitionistic Type Theory<\/i>, Bibliopolis, Naples, 1984. Zbl 0571.03030 MR 86j:03005"},{"key":"25","doi-asserted-by":"crossref","unstructured":"Marzetta, M., \u201cUniverses in the theories of types and names,\u201d pp. 340\u2013351 in <i>Computer Science Logic '92<\/i>, edited by E. B\u00f6rger et al., Lecture Notes in Computer Science, vol. 702, Springer-Verlag, Berlin, 1993. Zbl 0794.03083 MR 94i:03114","DOI":"10.1007\/3-540-56992-8_20"},{"key":"26","unstructured":"Parsons, C., \u201cThe liar Paradox,\u201d <i>Journal of Philosophical Logic<\/i>, vol. 3 (1974), pp. 381\u2013412. Zbl 0296.02001 MR 58:21402"},{"key":"27","doi-asserted-by":"crossref","unstructured":"Reinhardt, W., \u201cSome remarks on extending and interpreting theories with a partial predicate for truth,\u201d <i>Journal of Philosophical Logic<\/i>, vol. 15 (1986), pp. 219\u2013251. Zbl 0629.03002 MR 87i:03007","DOI":"10.1007\/BF00305492"},{"key":"28","doi-asserted-by":"crossref","unstructured":"Richter, W., and P. Aczel, \u201cInductive definitions and reflecting properties of admissible ordinals,\u201d pp. 301\u2013381 in <i>Generalized Recursion Theory<\/i>, edited by J. E. Fenstad and P. G. Hinman, North-Holland, Amsterdam, 1974. Zbl 0318.02042 MR 52:13344","DOI":"10.1016\/S0049-237X(08)70592-5"},{"key":"29","unstructured":"Sch\u00fctte, K., <i>Beweistheorie<\/i>, Springer-Verlag, Berlin, 1960. Zbl 0102.24704 MR 22:9438"},{"key":"30","doi-asserted-by":"crossref","unstructured":"Scott, D., \u201cCombinators and classes,\u201d pp. 1\u201326 in $\\lambda$<i>-Calculus and Computer Science<\/i>, edited by C. B\u00f6hm, Springer Lecture Notes in Computer Science, vol. 37, 1975. Zbl 0342.02018 MR 58:21489","DOI":"10.1007\/BFb0029517"},{"key":"31","doi-asserted-by":"crossref","unstructured":"Weyl, H., <i>Das Kontinuum<\/i>, Von Veit, Leipzig, 1918. Zbl 0005.15403 MR 22:10886","DOI":"10.1515\/9783112451144"},{"key":"3","doi-asserted-by":"crossref","unstructured":"Barwise, J., <i>Admissible Sets and Structures<\/i>, Springer-Verlag, Berlin, 1975. Zbl 0316.02047 MR 54:12519","DOI":"10.1007\/978-3-662-11035-5"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1305\/ndjfl\/1040248454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:12:27Z","timestamp":1706649147000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-36\/issue-2\/Levels-of-Truth\/10.1305\/ndjfl\/1040248454.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4,1]]},"references-count":31,"journal-issue":{"issue":"2","published-online":{"date-parts":[[1995,4,1]]}},"URL":"https:\/\/doi.org\/10.1305\/ndjfl\/1040248454","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4,1]]}}}