SearcharxivSearch

arXiv · 2210.09239

A Topological Representation of Semantics of First-order Logic and Its Application as a Method in Model Theory

Abstract

Various topological concepts are often involved in the research of mathematical logic, and almost all of these concepts can be regarded as developing from the Stone representation theorem. In the Stone representation theorem, a Boolean algebra is represented as the algebra of the clopen sets of a Stone space. And based on this, a natural connection is established between the structure of Stone space and the semantics of propositional logic. In other words, models of a propositional theory are represented as points in a Stone space. This enables us to use the concepts of topology to describe many facts in logic. In this paper, we do the same thing for the first-order logic. That is, we organize the basic objects of semantics of first-order logic, such as theories, models, elementary embeddings, and so on, into a kind of topological structure defined abstractly. To be precise, this kind of structure is a kind of enriched-topological space which we call cylindric space in this paper. Furthermore, based on this topological representation of semantics of first-order logic, we systematically introduce a method of point-set topology into the research of model theory. We demonstrate the great advantages of this topological method with an example and provide a general discussion of its features, advantages, and connection to the type space.

Explore related subjects

Keep this discovery

BibTeXRIS

Yunfei Qin. 2022-10-17. A Topological Representation of Semantics of First-order Logic and Its Application as a Method in Model Theory. https://arxiv.org/abs/2210.09239

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO