{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/71214"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/71214","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"On Weak Number Theories","abstract":"Decidability and definability are two separate but quite related topics in logic. Many undecidability results are proved by positive definability results. In Chapter 1 we reformulate Schinzel's theorem about diophantine equations with parameters to get some number theoretic results. In later chapter we apply these results to solve various decidability and definability problems. In Chapter 2 we prove that (FOR ALL)('n)(THERE EXISTS) over Z is decidable, then we generalize this result to an arbitrary ring of integers of a finite extension of rational numbers. In Chapter 3 we give a necessary condition for a set to be (FOR ALL)('n)(THERE EXISTS)-diophantine definable over R. From this necessary condition we can show that many subsets of R including N and cofinite subsets, are not (FOR ALL)('n)(THERE EXISTS)-diophantine definable. We also characterize those subsets of N such that the set and its complement in N both are (THERE EXISTS)-diophantine definable over N. From this we can answer negatively the question asked by J. P. Jones {5}. In Chapter 4 we prove that the set of prime numbers cannot be defined by a formula containing but one quantifier ranging over N. So far this is the only definite subset of N we know which has this property.","abstract_html":"Decidability and definability are two separate but quite related topics in logic. Many undecidability results are proved by positive definability results. In Chapter 1 we reformulate Schinzel's theorem about diophantine equations with parameters to get some number theoretic results. In later chapter we apply these results to solve various decidability and definability problems. In Chapter 2 we prove that (FOR ALL)('n)(THERE EXISTS) over Z is decidable, then we generalize this result to an arbitrary ring of integers of a finite extension of rational numbers. In Chapter 3 we give a necessary condition for a set to be (FOR ALL)('n)(THERE EXISTS)-diophantine definable over R. From this necessary condition we can show that many subsets of R including N and cofinite subsets, are not (FOR ALL)('n)(THERE EXISTS)-diophantine definable. We also characterize those subsets of N such that the set and its complement in N both are (THERE EXISTS)-diophantine definable over N. From this we can answer negatively the question asked by J. P. Jones {5}. In Chapter 4 we prove that the set of prime numbers cannot be defined by a formula containing but one quantifier ranging over N. So far this is the only definite subset of N we know which has this property.","abstract_has_math":false,"creators":["Tung, Shih-Ping"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-16T06:18:06Z","date_published":"2014-12-16T06:18:06Z","updated_at":"2026-07-22T22:26:04Z","subjects":["Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8409843"],"render_values":[{"text":"(UMI)AAI8409843","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/71214","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Tung, Shih-Ping"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-16T06:18:06Z","10000-01-01","1984"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/71214","(UMI)AAI8409843"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Decidability and definability are two separate but quite related topics in logic. Many undecidability results are proved by positive definability results. In Chapter 1 we reformulate Schinzel's theorem about diophantine equations with parameters to get some number theoretic results. In later chapter we apply these results to solve various decidability and definability problems. In Chapter 2 we prove that (FOR ALL)('n)(THERE EXISTS) over Z is decidable, then we generalize this result to an arbitrary ring of integers of a finite extension of rational numbers. In Chapter 3 we give a necessary condition for a set to be (FOR ALL)('n)(THERE EXISTS)-diophantine definable over R. From this necessary condition we can show that many subsets of R including N and cofinite subsets, are not (FOR ALL)('n)(THERE EXISTS)-diophantine definable. We also characterize those subsets of N such that the set and its complement in N both are (THERE EXISTS)-diophantine definable over N. From this we can answer negatively the question asked by J. P. Jones {5}. In Chapter 4 we prove that the set of prime numbers cannot be defined by a formula containing but one quantifier ranging over N. So far this is the only definite subset of N we know which has this property.","Z. Adamowicz constructed a model which has some induction schemes but Matijasevic's theorem fails in this model. In order to prove her induction schemes she has to assume a very strong unproved conjecture, namely Schinzel's hypothesis H. With a result we prove in Chapter 1 we can prove the same induction schemes without assuming hypothesis H.","Made available in DSpace on 2014-12-16T06:18:06Z (GMT). No. of bitstreams: 1 8409843.pdf: 1697356 bytes, checksum: 721dee83a5926fc1c1994e4eb4942c1a (MD5) Previous issue date: 1984","Embargo set by: Seth Robbins for item 71380 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","58 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984."]},{"key":"dc:title","label":"Title","values":["On Weak Number Theories"]}]}],"canonical_facts":{"dc:creator":["Tung, Shih-Ping"],"dc:date":["2014-12-16T06:18:06Z","10000-01-01","1984"],"dc:description":["Decidability and definability are two separate but quite related topics in logic. Many undecidability results are proved by positive definability results. In Chapter 1 we reformulate Schinzel's theorem about diophantine equations with parameters to get some number theoretic results. In later chapter we apply these results to solve various decidability and definability problems. In Chapter 2 we prove that (FOR ALL)('n)(THERE EXISTS) over Z is decidable, then we generalize this result to an arbitrary ring of integers of a finite extension of rational numbers. In Chapter 3 we give a necessary condition for a set to be (FOR ALL)('n)(THERE EXISTS)-diophantine definable over R. From this necessary condition we can show that many subsets of R including N and cofinite subsets, are not (FOR ALL)('n)(THERE EXISTS)-diophantine definable. We also characterize those subsets of N such that the set and its complement in N both are (THERE EXISTS)-diophantine definable over N. From this we can answer negatively the question asked by J. P. Jones {5}. In Chapter 4 we prove that the set of prime numbers cannot be defined by a formula containing but one quantifier ranging over N. So far this is the only definite subset of N we know which has this property.","Z. Adamowicz constructed a model which has some induction schemes but Matijasevic's theorem fails in this model. In order to prove her induction schemes she has to assume a very strong unproved conjecture, namely Schinzel's hypothesis H. With a result we prove in Chapter 1 we can prove the same induction schemes without assuming hypothesis H.","Made available in DSpace on 2014-12-16T06:18:06Z (GMT). No. of bitstreams: 1 8409843.pdf: 1697356 bytes, checksum: 721dee83a5926fc1c1994e4eb4942c1a (MD5) Previous issue date: 1984","Embargo set by: Seth Robbins for item 71380 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","58 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984."],"dc:identifier":["http://hdl.handle.net/2142/71214","(UMI)AAI8409843"],"dc:subject":["Mathematics"],"dc:title":["On Weak Number Theories"],"dc:type":["text"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:04Z"}