Contributed Talks 14
Chair: Luca San Mauro
Talks in this session
| 17:30 |
Ellen Hammatt, The punctual degrees of linear orders |
|
In 2017, Kalimullin, Melnikov and Ng initiated the systematic study of the primitive recursive content of mathematics. The main idea of such studies is eliminating unbounded search from various abstract algorithms in computable structure theory. The main definition in the theory of punctual structures is the following. An algebraic structure is punctual (or fully primitive recursive) if its domain is the set of natural numbers and the operations and relations are represented by primitive recursive functions. An instance of this is called a punctual presentation. In computable structure theory, computable presentations are viewed up to computable isomorphism. In the punctual setting, this is no longer straightforward due to the fact that the inverse of a primitive recursive bijection does not need to be primitive recursive. We notice that this induces a natural partial order on punctual presentation. This partial order induces a degree structure on all punctual presentations \(\mathcal{M}\) which we call the punctual degrees of \(\mathcal{M}\) and denote \(PR(\mathcal{M})\). We study the properties of the punctual degrees for linear orders. In [1], we showed that the punctual degrees of \((\mathbb{Z},<)\) is dense. In contrast, Koh, Melnikov and Ng [2] have recently proven that the punctual degrees of \(\mathbb{Q}\) is not dense. We study this further investigating whether we can embed the atomless Boolean algebra into the punctual degrees for linear orders. The first step towards this is to build a diamond, where we construct presentations \(A,B,C,D\) so that \(C\) and \(D\) are incomparable, \(A=\inf(C,D)\) and \(B=\sup(C,D)\). We will discuss the complications and techniques required to embed the diamond and atomless Boolean algebra in the punctual degrees of rigid linear orders and the rational numbers. All work presented is joint work with Dorzhieva. Bibliography
|
|
| 17:50 |
Hsing-Chien Tsai, Atomicity under non-transitive mereology |
|
The non-transitive mereology (NTM) to be addressed in this talk is axiomatized by the following axioms and axiom schema (\(Oxy=\exists z(Pzx\land Pzy)\)).
Note that we will get the so-called General Extensional Mereology (GEM) if we add the transitivity axiom: \(\forall x\forall y\forall z((Pxy\land Pyz)\to Pxz)\) to the foregoing list. In this talk, the following four definitions of atomicity will be considered where \(Atom(x)=\forall y(Pyx\to x=y)\).
It is easy to see that all of these definitions are equivalent under GEM. But we will show that some pairs of them are not equivalent under NTM. Furthermore, we will also show that NTM+\(\forall xA3(x)\) is equivalent to GEM+\(\forall xA0(x)\) (hence to GEM+\(\forall xAi(x)\), where i=0 to 3). Such a result means that we won’t get any stronger atomic theory even if we define an atomicity predicate finer than A3(x). |
|
| 18:10 |
Davide Sutto, A History of Level Theories: From Ranks to Levels. |
|
The paper presents a comprehensive history of the formalizations of the Iterative Conception of Set. First, I show how the core idea originated, even before Zermelo’s \(V_\alpha\)s, in reflections on ranks appearing in Mirimanoff’s 1910s contributions and earlier notes by German mathematicians. Second, I emphasize the seminal role played by Tarski’s School in developing the notion of rank and further argue that the actual genesis of the conception is to be found in Tarski’s 1950s set theory seminars, later developed in [2] and [3]. Third, I focus on the crucial passage from the notion of rank to its more explicit characterization: levels. In the work of Tarski’s School we can find the first formulations of axiomatic theories of levels in purely set theoretic terms. This is relevant as I move forward to Shoenfield and Boolos, who rather outline stage theories, adopting stages as a further primitive. Finally, I close with the more recent contributions of Potter and Button, who revitalized the notion of level by making it more tractable. Bibliography
|