Abstract In this thesis, we study transfer principles in the context of certain Henselian valued fields, namely Henselian valued fields of equicharacteristic $0$ , algebraically closed valued fields, algebraically maximal Kaplansky valued fields, and unramified mixed characteristic Henselian valued fields with perfect residue field. First, we compute the burden of such a valued field in terms of the burden of its value group and its residue field. The burden is a cardinal related to the model theoretic complexity and a notion of dimension associated to $text {NTP}_2$ theories. We show, for instance, that the Hahn field $mathbb {F}_p^{text {alg}}((mathbb {Z}[1/p]))$ is inp-minimal (of burden 1), and that the ring of Witt vectors $W(mathbb {F}_p^{text {alg}})$ over $mathbb {F}_p^{text {alg}}$ is not strong (of burden $omega $ ). This result extends previous work by Chernikov and Simon and realizes an important step toward the classification of Henselian valued fields of finite burden. Second, we show a transfer principle for the property that all types realized in a given elementary extension are definable. It can be written as follows: a valued field as above is stably embedded in an elementary extension if and only if its value group is stably embedded in the corresponding extension of value groups, its residue field is stably embedded in the corresponding extension of residue fields, and the extension of valued fields satisfies a certain algebraic condition. We show, for instance, that all types over the power series field $mathbb {R}((t))$ are definable. Similarly, all types over the quotient field of $W(mathbb {F}_p^{text {alg}})$ are definable. This extends previous work of Cubides and Delon and of Cubides and Ye. These distinct results use a common approach, which has been developed recently. It consists of establishing first a reduction to an intermediate structure called the leading term structure, or $operatorname {mathrm {RV}}$ -sort, and then of reducing to the value group and residue field. This leads us to develop similar reduction principles in the context of pure short exact sequences of abelian groups. Abstract prepared by Pierre Touchard. E-mail: pierre.pa.touchard@gmail.com URL: https://miami.uni-muenster.de/Record/a612cf73-0a2f-42c4-b1e4-7d28934138a9
{"title":"Transfer Principles in Henselian Valued Fields","authors":"Pierre Touchard","doi":"10.1017/bsl.2021.31","DOIUrl":"https://doi.org/10.1017/bsl.2021.31","url":null,"abstract":"Abstract In this thesis, we study transfer principles in the context of certain Henselian valued fields, namely Henselian valued fields of equicharacteristic \u0000$0$\u0000 , algebraically closed valued fields, algebraically maximal Kaplansky valued fields, and unramified mixed characteristic Henselian valued fields with perfect residue field. First, we compute the burden of such a valued field in terms of the burden of its value group and its residue field. The burden is a cardinal related to the model theoretic complexity and a notion of dimension associated to \u0000$text {NTP}_2$\u0000 theories. We show, for instance, that the Hahn field \u0000$mathbb {F}_p^{text {alg}}((mathbb {Z}[1/p]))$\u0000 is inp-minimal (of burden 1), and that the ring of Witt vectors \u0000$W(mathbb {F}_p^{text {alg}})$\u0000 over \u0000$mathbb {F}_p^{text {alg}}$\u0000 is not strong (of burden \u0000$omega $\u0000 ). This result extends previous work by Chernikov and Simon and realizes an important step toward the classification of Henselian valued fields of finite burden. Second, we show a transfer principle for the property that all types realized in a given elementary extension are definable. It can be written as follows: a valued field as above is stably embedded in an elementary extension if and only if its value group is stably embedded in the corresponding extension of value groups, its residue field is stably embedded in the corresponding extension of residue fields, and the extension of valued fields satisfies a certain algebraic condition. We show, for instance, that all types over the power series field \u0000$mathbb {R}((t))$\u0000 are definable. Similarly, all types over the quotient field of \u0000$W(mathbb {F}_p^{text {alg}})$\u0000 are definable. This extends previous work of Cubides and Delon and of Cubides and Ye. These distinct results use a common approach, which has been developed recently. It consists of establishing first a reduction to an intermediate structure called the leading term structure, or \u0000$operatorname {mathrm {RV}}$\u0000 -sort, and then of reducing to the value group and residue field. This leads us to develop similar reduction principles in the context of pure short exact sequences of abelian groups. Abstract prepared by Pierre Touchard. E-mail: pierre.pa.touchard@gmail.com URL: https://miami.uni-muenster.de/Record/a612cf73-0a2f-42c4-b1e4-7d28934138a9","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88393859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"BSL volume 27 issue 2 Cover and Front matter","authors":"","doi":"10.1017/bsl.2021.44","DOIUrl":"https://doi.org/10.1017/bsl.2021.44","url":null,"abstract":"","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86596539","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"BSL volume 27 issue 2 Cover and Back matter","authors":"","doi":"10.1017/bsl.2021.45","DOIUrl":"https://doi.org/10.1017/bsl.2021.45","url":null,"abstract":"","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89629814","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Following our [6], though with somewhat different methods here, further variants of Goodstein sequences are introduced in terms of parameterized Ackermann–Péter functions. Each of the sequences is shown to terminate, and the proof-theoretic strengths of these facts are calibrated by means of ordinal assignments, yielding independence results for a range of theories: PRA, PA, $Sigma ^1_1$ -DC $_0$ , ATR $_0$ , up to ID $_1$ . The key is the so-called “Hardy hierarchy” of proof-theoretic bounding finctions, providing a uniform method for associating Goodstein-type sequences with parameterized normal form representations of positive integers.
{"title":"GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION","authors":"T. Arai, S. Wainer, A. Weiermann","doi":"10.1017/bsl.2021.30","DOIUrl":"https://doi.org/10.1017/bsl.2021.30","url":null,"abstract":"Abstract Following our [6], though with somewhat different methods here, further variants of Goodstein sequences are introduced in terms of parameterized Ackermann–Péter functions. Each of the sequences is shown to terminate, and the proof-theoretic strengths of these facts are calibrated by means of ordinal assignments, yielding independence results for a range of theories: PRA, PA, \u0000$Sigma ^1_1$\u0000 -DC \u0000$_0$\u0000 , ATR \u0000$_0$\u0000 , up to ID \u0000$_1$\u0000 . The key is the so-called “Hardy hierarchy” of proof-theoretic bounding finctions, providing a uniform method for associating Goodstein-type sequences with parameterized normal form representations of positive integers.","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89117602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract The dissertation under comment is a contribution to the area of Set Theory concerned with the interactions between the method of Forcing and the so-called Large Cardinal axioms. The dissertation is divided into two thematic blocks. In Block I we analyze the large-cardinal hierarchy between the first supercompact cardinal and Vopěnka’s Principle (Part I). In turn, Block II is devoted to the investigation of some problems arising from Singular Cardinal Combinatorics (Part II and Part III). We commence Part I by investigating the Identity Crisis phenomenon in the region comprised between the first supercompact cardinal and Vopěnka’s Principle. As a result, we generalize Magidor’s classical theorems [2] to this higher region of the large-cardinal hierarchy. Also, our analysis allows to settle all the questions that were left open in [1]. Finally, we conclude Part I by presenting a general theory of preservation of $C^{(n)}$ -extendible cardinals under class forcing iterations. From this analysis we derive several applications. For instance, our arguments are used to show that an extendible cardinal is consistent with “ $(lambda ^{+omega })^{mathrm {HOD}}
{"title":"Contributions to the Theory of Large Cardinals through the Method of Forcing","authors":"Alejandro Poveda","doi":"10.1017/bsl.2021.22","DOIUrl":"https://doi.org/10.1017/bsl.2021.22","url":null,"abstract":"Abstract The dissertation under comment is a contribution to the area of Set Theory concerned with the interactions between the method of Forcing and the so-called Large Cardinal axioms. The dissertation is divided into two thematic blocks. In Block I we analyze the large-cardinal hierarchy between the first supercompact cardinal and Vopěnka’s Principle (Part I). In turn, Block II is devoted to the investigation of some problems arising from Singular Cardinal Combinatorics (Part II and Part III). We commence Part I by investigating the Identity Crisis phenomenon in the region comprised between the first supercompact cardinal and Vopěnka’s Principle. As a result, we generalize Magidor’s classical theorems [2] to this higher region of the large-cardinal hierarchy. Also, our analysis allows to settle all the questions that were left open in [1]. Finally, we conclude Part I by presenting a general theory of preservation of \u0000$C^{(n)}$\u0000 -extendible cardinals under class forcing iterations. From this analysis we derive several applications. For instance, our arguments are used to show that an extendible cardinal is consistent with “ \u0000$(lambda ^{+omega })^{mathrm {HOD}}<lambda ^+$\u0000 , for every regular cardinal \u0000$lambda $\u0000 .” In particular, if Woodin’s HOD Conjecture holds, and therefore it is provable in ZFC + “There exists an extendible cardinal” that above the first extendible cardinal every singular cardinal \u0000$lambda $\u0000 is singular in HOD and \u0000$(lambda ^+)^{textrm {{HOD}}}=lambda ^+$\u0000 , there may still be no agreement at all between V and HOD about successors of regular cardinals. In Part II and Part III we analyse the relationship between the Singular Cardinal Hypothesis (SCH) with other relevant combinatorial principles at the level of successors of singular cardinals. Two of these are the Tree Property and the Reflection of Stationary sets, which are central in Infinite Combinatorics. Specifically, Part II is devoted to prove the consistency of the Tree Property at both \u0000$kappa ^+$\u0000 and \u0000$kappa ^{++}$\u0000 , whenever \u0000$kappa $\u0000 is a strong limit singular cardinal witnessing an arbitrary failure of the SCH. This generalizes the main result of [3] in two senses: it allows arbitrary cofinalities for \u0000$kappa $\u0000 and arbitrary failures for the SCH. In the last part of the dissertation (Part III) we introduce the notion of \u0000$Sigma $\u0000 -Prikry forcing. This new concept allows an abstract and uniform approach to the theory of Prikry-type forcings and encompasses several classical examples of Prikry-type forcing notions, such as the classical Prikry forcing, the Gitik-Sharon poset, or the Extender Based Prikry forcing, among many others. Our motivation in this part of the dissertation is to prove an iteration theorem at the level of the successor of a singular cardinal. Specifically, we aim for a theorem asserting that every \u0000$kappa ^{++}$\u0000 -length iteration with support of size \u0000$leq kappa $\u0000 has the \u0000$kappa ^{++}$\u0000 -cc, provided the iterates belong to a relevan","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80403023","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Martin’s conjecture is an attempt to classify the behavior of all definable functions on the Turing degrees under strong set theoretic hypotheses. Very roughly it says that every such function is either eventually constant, eventually equal to the identity function or eventually equal to a transfinite iterate of the Turing jump. It is typically divided into two parts: the first part states that every function is either eventually constant or eventually above the identity function and the second part states that every function which is above the identity is eventually equal to a transfinite iterate of the jump. If true, it would provide an explanation for the unique role of the Turing jump in computability theory and rule out many types of constructions on the Turing degrees. In this thesis, we will introduce a few tools which we use to prove several cases of Martin’s conjecture. It turns out that both these tools and these results on Martin’s conjecture have some interesting consequences both for Martin’s conjecture and for a few related topics. The main tool that we introduce is a basis theorem for perfect sets, improving a theorem due to Groszek and Slaman. We also introduce a general framework for proving certain special cases of Martin’s conjecture which unifies a few pre-existing proofs. We will use these tools to prove three main results about Martin’s conjecture: that it holds for regressive functions on the hyperarithmetic degrees (answering a question of Slaman and Steel), that part 1 holds for order preserving functions on the Turing degrees, and that part 1 holds for a class of functions that we introduce, called measure preserving functions. This last result has several interesting consequences for the study of Martin’s conjecture. In particular, it shows that part 1 of Martin’s conjecture is equivalent to a statement about the Rudin-Keisler order on ultrafilters on the Turing degrees. This suggests several possible strategies for working on part 1 of Martin’s conjecture, which we will discuss. The basis theorem that we use to prove these results also has some applications outside of Martin’s conjecture. We will use it to prove a few theorems related to Sacks’ question about whether it is provable in $mathsf {ZFC}$ that every locally countable partial order of size continuum embeds into the Turing degrees. We will show that in a certain extension of $mathsf {ZF}$ (which is incompatible with $mathsf {ZFC}$ ), this holds for all partial orders of height two, but not for all partial orders of height three. Our proof also yields an analogous result for Borel partial orders and Borel embeddings in $mathsf {ZF}$ , which shows that the Borel version of Sacks’ question has a negative answer. We will end the thesis with a list of open questions related to Martin’s conjecture, which we hope will stimulate further research. Abstract prepared by Patrick Lutz. E-mail: pglutz@berkeley.edu
{"title":"Results on Martin’s Conjecture","authors":"P. Lutz","doi":"10.1017/bsl.2021.27","DOIUrl":"https://doi.org/10.1017/bsl.2021.27","url":null,"abstract":"Abstract Martin’s conjecture is an attempt to classify the behavior of all definable functions on the Turing degrees under strong set theoretic hypotheses. Very roughly it says that every such function is either eventually constant, eventually equal to the identity function or eventually equal to a transfinite iterate of the Turing jump. It is typically divided into two parts: the first part states that every function is either eventually constant or eventually above the identity function and the second part states that every function which is above the identity is eventually equal to a transfinite iterate of the jump. If true, it would provide an explanation for the unique role of the Turing jump in computability theory and rule out many types of constructions on the Turing degrees. In this thesis, we will introduce a few tools which we use to prove several cases of Martin’s conjecture. It turns out that both these tools and these results on Martin’s conjecture have some interesting consequences both for Martin’s conjecture and for a few related topics. The main tool that we introduce is a basis theorem for perfect sets, improving a theorem due to Groszek and Slaman. We also introduce a general framework for proving certain special cases of Martin’s conjecture which unifies a few pre-existing proofs. We will use these tools to prove three main results about Martin’s conjecture: that it holds for regressive functions on the hyperarithmetic degrees (answering a question of Slaman and Steel), that part 1 holds for order preserving functions on the Turing degrees, and that part 1 holds for a class of functions that we introduce, called measure preserving functions. This last result has several interesting consequences for the study of Martin’s conjecture. In particular, it shows that part 1 of Martin’s conjecture is equivalent to a statement about the Rudin-Keisler order on ultrafilters on the Turing degrees. This suggests several possible strategies for working on part 1 of Martin’s conjecture, which we will discuss. The basis theorem that we use to prove these results also has some applications outside of Martin’s conjecture. We will use it to prove a few theorems related to Sacks’ question about whether it is provable in $mathsf {ZFC}$ that every locally countable partial order of size continuum embeds into the Turing degrees. We will show that in a certain extension of $mathsf {ZF}$ (which is incompatible with $mathsf {ZFC}$ ), this holds for all partial orders of height two, but not for all partial orders of height three. Our proof also yields an analogous result for Borel partial orders and Borel embeddings in $mathsf {ZF}$ , which shows that the Borel version of Sacks’ question has a negative answer. We will end the thesis with a list of open questions related to Martin’s conjecture, which we hope will stimulate further research. Abstract prepared by Patrick Lutz. E-mail: pglutz@berkeley.edu","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77694352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract The present thesis lies at the interface of logic and linguistics; its object of study are control sentences with overt pronouns in Romance languages (European and Brazilian Portuguese, Italian and Spanish). This is a topic that has received considerably more attention on the part of linguists, especially in recent years, than from logicians. Perhaps for this reason, much remains to be understood about these linguistic structures and their underlying logical properties. This thesis seeks to fill the lacunas in the literature or at least take steps in this direction by way of addressing a number of issues that have so far been under-explored. To this end, we put forward two key questions, one linguistic and the other logical. These are, respectively, (1) What is the syntactic status of the surface pronoun? and (2) What are the available mechanisms to reuse semantic resources in a contraction-free logical grammar? Accordingly, the thesis is divided into two parts: generative linguistics and categorial grammar. Part I starts by reviewing the recent discussion within the generative literature on infinitive clauses with overt subjects, paying detailed attention to the main accounts in the field. Part II does the same on the logical grammar front, addressing in particular the issues of control and of anaphoric pronouns. Ultimately, the leading accounts from both camps will be found wanting. The closing chapter of each of Part I and Part II will thus put forward alternative candidates, that we contend are more successful than their predecessors. More specifically, in Part I, we offer a linguistic account along the lines of Landau’s T/Agr theory of control. In Part II, we present two alternative categorial accounts: one based on Combinatory Categorial Grammar, the other on Type-Logical Grammar. Each of these accounts offers an improved, more fine-grained perspective on control infinitives featuring overt pronominal subjects. Finally, we include an Appendix in which our type-logical proposal is implemented in a categorial parser/theorem-prover. Abstract prepared by María Inés Corbalán. E-mail: inescorbalan@yahoo.com.ar URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/331697
{"title":"From Generative Linguistics to Categorial Grammars: Overt Subjects in Control Infinitives","authors":"María Inés Corbalán","doi":"10.1017/bsl.2021.32","DOIUrl":"https://doi.org/10.1017/bsl.2021.32","url":null,"abstract":"Abstract The present thesis lies at the interface of logic and linguistics; its object of study are control sentences with overt pronouns in Romance languages (European and Brazilian Portuguese, Italian and Spanish). This is a topic that has received considerably more attention on the part of linguists, especially in recent years, than from logicians. Perhaps for this reason, much remains to be understood about these linguistic structures and their underlying logical properties. This thesis seeks to fill the lacunas in the literature or at least take steps in this direction by way of addressing a number of issues that have so far been under-explored. To this end, we put forward two key questions, one linguistic and the other logical. These are, respectively, (1) What is the syntactic status of the surface pronoun? and (2) What are the available mechanisms to reuse semantic resources in a contraction-free logical grammar? Accordingly, the thesis is divided into two parts: generative linguistics and categorial grammar. Part I starts by reviewing the recent discussion within the generative literature on infinitive clauses with overt subjects, paying detailed attention to the main accounts in the field. Part II does the same on the logical grammar front, addressing in particular the issues of control and of anaphoric pronouns. Ultimately, the leading accounts from both camps will be found wanting. The closing chapter of each of Part I and Part II will thus put forward alternative candidates, that we contend are more successful than their predecessors. More specifically, in Part I, we offer a linguistic account along the lines of Landau’s T/Agr theory of control. In Part II, we present two alternative categorial accounts: one based on Combinatory Categorial Grammar, the other on Type-Logical Grammar. Each of these accounts offers an improved, more fine-grained perspective on control infinitives featuring overt pronominal subjects. Finally, we include an Appendix in which our type-logical proposal is implemented in a categorial parser/theorem-prover. Abstract prepared by María Inés Corbalán. E-mail: inescorbalan@yahoo.com.ar URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/331697","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79476208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract There are many computational problems which are generally “easy” to solve but have certain rare examples which are much more difficult to solve. One approach to studying these problems is to ignore the difficult edge cases. Asymptotic computability is one of the formal tools that uses this approach to study these problems. Asymptotically computable sets can be thought of as almost computable sets, however every set is computationally equivalent to an almost computable set. Intrinsic density was introduced as a way to get around this unsettling fact, and which will be our main focus. Of particular interest for the first half of this dissertation are the intrinsically small sets, the sets of intrinsic density $0$ . While the bulk of the existing work concerning intrinsic density was focused on these sets, there were still many questions left unanswered. The first half of this dissertation answers some of these questions. We proved some useful closure properties for the intrinsically small sets and applied them to prove separations for the intrinsic variants of asymptotic computability. We also completely separated hyperimmunity and intrinsic smallness in the Turing degrees and resolved some open questions regarding the relativization of intrinsic density. For the second half of this dissertation, we turned our attention to the study of intermediate intrinsic density. We developed a calculus using noncomputable coding operations to construct examples of sets with intermediate intrinsic density. For almost all $rin (0,1)$ , this construction yielded the first known example of a set with intrinsic density r which cannot compute a set random with respect to the r-Bernoulli measure. Motivated by the fact that intrinsic density coincides with the notion of injection stochasticity, we applied these techniques to study the structure of the more well-known notion of MWC-stochasticity. Abstract prepared by Justin Miller. E-mail: jmille74@nd.edu URL: https://curate.nd.edu/show/6t053f4938w
{"title":"Intrinsic density, asymptotic computability, and stochasticity","authors":"Justin Miller","doi":"10.1017/bsl.2021.21","DOIUrl":"https://doi.org/10.1017/bsl.2021.21","url":null,"abstract":"Abstract There are many computational problems which are generally “easy” to solve but have certain rare examples which are much more difficult to solve. One approach to studying these problems is to ignore the difficult edge cases. Asymptotic computability is one of the formal tools that uses this approach to study these problems. Asymptotically computable sets can be thought of as almost computable sets, however every set is computationally equivalent to an almost computable set. Intrinsic density was introduced as a way to get around this unsettling fact, and which will be our main focus. Of particular interest for the first half of this dissertation are the intrinsically small sets, the sets of intrinsic density \u0000$0$\u0000 . While the bulk of the existing work concerning intrinsic density was focused on these sets, there were still many questions left unanswered. The first half of this dissertation answers some of these questions. We proved some useful closure properties for the intrinsically small sets and applied them to prove separations for the intrinsic variants of asymptotic computability. We also completely separated hyperimmunity and intrinsic smallness in the Turing degrees and resolved some open questions regarding the relativization of intrinsic density. For the second half of this dissertation, we turned our attention to the study of intermediate intrinsic density. We developed a calculus using noncomputable coding operations to construct examples of sets with intermediate intrinsic density. For almost all \u0000$rin (0,1)$\u0000 , this construction yielded the first known example of a set with intrinsic density r which cannot compute a set random with respect to the r-Bernoulli measure. Motivated by the fact that intrinsic density coincides with the notion of injection stochasticity, we applied these techniques to study the structure of the more well-known notion of MWC-stochasticity. Abstract prepared by Justin Miller. E-mail: jmille74@nd.edu URL: https://curate.nd.edu/show/6t053f4938w","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75918753","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract This dissertation is highly motivated by d.r.e. Nondensity Theorem, which is interesting in two perspectives. One is that it contrasts Sacks Density Theorem, and hence shows that the structures of r.e. degrees and d.r.e. degrees are different. The other is to investigate what other properties a maximal degree can have. In Chapter 1, we briefly review the backgrounds of Recursion Theory which motivate the topics of this dissertation. In Chapter 2, we introduce the notion of $(m,n)$ -cupping degree. It is closely related to the notion of maximal d.r.e. degree. In fact, a $(2,2)$ -cupping degree is maximal d.r.e. degree. We then prove that there exists an isolated $(2,omega )$ -cupping degree by combining strategies for maximality and isolation with some efforts. Chapter 3 is part of a joint project with Steffen Lempp, Yiqun Liu, Keng Meng Ng, Cheng Peng, and Guohua Wu. In this chapter, we prove that any finite boolean algebra can be embedded into d.r.e. degrees as a final segment. We examine the proof of d.r.e. Nondensity Theorem and make developments to the technique to make it work for our theorem. The goal of the project is to see what lattice can be embedded into d.r.e. degrees as a final segment, as we observe that the technique has potential be developed further to produce other interesting results. Abstract prepared by Yong Liu. E-mail: liuyong0112@nju.edu.cn
{"title":"The Structure of d.r.e. Degrees","authors":"Yong Liu","doi":"10.1017/bsl.2021.38","DOIUrl":"https://doi.org/10.1017/bsl.2021.38","url":null,"abstract":"Abstract This dissertation is highly motivated by d.r.e. Nondensity Theorem, which is interesting in two perspectives. One is that it contrasts Sacks Density Theorem, and hence shows that the structures of r.e. degrees and d.r.e. degrees are different. The other is to investigate what other properties a maximal degree can have. In Chapter 1, we briefly review the backgrounds of Recursion Theory which motivate the topics of this dissertation. In Chapter 2, we introduce the notion of \u0000$(m,n)$\u0000 -cupping degree. It is closely related to the notion of maximal d.r.e. degree. In fact, a \u0000$(2,2)$\u0000 -cupping degree is maximal d.r.e. degree. We then prove that there exists an isolated \u0000$(2,omega )$\u0000 -cupping degree by combining strategies for maximality and isolation with some efforts. Chapter 3 is part of a joint project with Steffen Lempp, Yiqun Liu, Keng Meng Ng, Cheng Peng, and Guohua Wu. In this chapter, we prove that any finite boolean algebra can be embedded into d.r.e. degrees as a final segment. We examine the proof of d.r.e. Nondensity Theorem and make developments to the technique to make it work for our theorem. The goal of the project is to see what lattice can be embedded into d.r.e. degrees as a final segment, as we observe that the technique has potential be developed further to produce other interesting results. Abstract prepared by Yong Liu. E-mail: liuyong0112@nju.edu.cn","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77817885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract The purpose of this thesis is to develop a paraconsistent Model Theory. The basis for such a theory was launched by Walter Carnielli, Marcelo Esteban Coniglio, Rodrigo Podiack, and Tarcísio Rodrigues in the article ‘On the Way to a Wider Model Theory: Completeness Theorems for First-Order Logics of Formal Inconsistency’ [The Review of Symbolic Logic, vol. 7 (2014)]. Naturally, a complete theory cannot be fully developed in a single work. Indeed, the goal of this work is to show that a paraconsistent Model Theory is a sound and worthy possibility. The pursuit of this goal is divided in three tasks: The first one is to give the theory a philosophical meaning. The second one is to transpose as many results from the classical theory to the new one as possible. The third one is to show an application of the theory to practical science. The response to the first task is a Paraconsistent Reasoning System. The start point is that paraconsistency is an epistemological concept. The pursuit of a deeper understanding of the phenomenon of paraconsistency from this point of view leads to a reasoning system based on the Logics of Formal Inconsistency. Models are regarded as states of knowledge and the concept of isomorphism is reformulated so as to give raise to a new concept that preserves a portion of the whole knowledge of each state. Based on this, a notion of refinement is created which may occur from inside or from outside the state. In order to respond to the second task, two important classical results, namely the Omitting Types Theorem and Craig’s Interpolation Theorem are shown to hold in the new system and it is also shown that, if classical results in general are to hold in a paraconsistent system, then such a system should be in essence how it was developed here. Finally, the response to the third task is a proposal of what a Paraconsistent Logic Programming may be. For that, the basis for a paraconsistent PROLOG is settled in the light of the ideas developed so far. Abstract prepared by Bruno Costa Coscarelli. E-mail: brunocostacoscarelli@gmail.com URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/331697
{"title":"Model Theory in a Paraconsistent Environment","authors":"B. C. Coscarelli","doi":"10.1017/bsl.2021.33","DOIUrl":"https://doi.org/10.1017/bsl.2021.33","url":null,"abstract":"Abstract The purpose of this thesis is to develop a paraconsistent Model Theory. The basis for such a theory was launched by Walter Carnielli, Marcelo Esteban Coniglio, Rodrigo Podiack, and Tarcísio Rodrigues in the article ‘On the Way to a Wider Model Theory: Completeness Theorems for First-Order Logics of Formal Inconsistency’ [The Review of Symbolic Logic, vol. 7 (2014)]. Naturally, a complete theory cannot be fully developed in a single work. Indeed, the goal of this work is to show that a paraconsistent Model Theory is a sound and worthy possibility. The pursuit of this goal is divided in three tasks: The first one is to give the theory a philosophical meaning. The second one is to transpose as many results from the classical theory to the new one as possible. The third one is to show an application of the theory to practical science. The response to the first task is a Paraconsistent Reasoning System. The start point is that paraconsistency is an epistemological concept. The pursuit of a deeper understanding of the phenomenon of paraconsistency from this point of view leads to a reasoning system based on the Logics of Formal Inconsistency. Models are regarded as states of knowledge and the concept of isomorphism is reformulated so as to give raise to a new concept that preserves a portion of the whole knowledge of each state. Based on this, a notion of refinement is created which may occur from inside or from outside the state. In order to respond to the second task, two important classical results, namely the Omitting Types Theorem and Craig’s Interpolation Theorem are shown to hold in the new system and it is also shown that, if classical results in general are to hold in a paraconsistent system, then such a system should be in essence how it was developed here. Finally, the response to the third task is a proposal of what a Paraconsistent Logic Programming may be. For that, the basis for a paraconsistent PROLOG is settled in the light of the ideas developed so far. Abstract prepared by Bruno Costa Coscarelli. E-mail: brunocostacoscarelli@gmail.com URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/331697","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85944665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：