中文
相关论文

相关论文: Independence Phenomena in Mathematics: a Set Theor…

200 篇论文

Although some work has been done on the metamathematics of Metamath, there has not been a clear definition of a model for a Metamath formal system. We define the collection of models of an arbitrary Metamath formal system, both for…

逻辑 · 数学 2016-05-10 Mario Carneiro

We introduce the concept of inverse powerset by adding three axioms to the Zermelo-Fraenkel set theory. This extends the Zermelo-Fraenkel set theory with a new type of set which is motivated by an intuitive meaning and interesting…

逻辑 · 数学 2012-05-17 Patrick St-Amant

The theory of finitely supported algebraic structures represents a reformulation of Zermelo-Fraenkel set theory in which every construction is finitely supported according to the action of a group of permutations of some basic elements…

逻辑 · 数学 2019-09-05 Andrei Alexandru , Gabriel Ciobanu

Free independence is an important tool for studying the structure of operator algebras. It is natural to ask from the model-theoretic standpoint whether free independence is captured well in first-order model theory via the notion of a…

算子代数 · 数学 2026-02-25 William Boulanger , Jakub Curda , Emma Harvey , Yizhi Li , Jennifer Pi

This paper introduces a new theory which encompasses concepts and ideas from set theory, type theory, and Le\'{s}niewski's mereology and describes its possibility as an alternative foundation for mathematics. In the introduction section I…

逻辑 · 数学 2016-09-15 Jin Hoo Lee

Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…

综合数学 · 数学 2026-03-13 Marcoen J. T. F. Cabbolet , Adrian R. D. Mathias

A proof of G\"odel's incompleteness theorem is given. With this new proof a transfinite extension of G\"odel's theorem is considered. It is shown that if one assumes the set theory ZFC on the meta level as well as on the object level, a…

逻辑 · 数学 2009-05-25 Hitoshi Kitada

The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…

计算机科学中的逻辑 · 计算机科学 2018-03-20 Jean-Louis Krivine

Although the categorical arithmetic is not effectively axiomatizable, the belief that the incompleteness Theorems can be apply to it is fairly common. Furthermore, the so-called "essential" (or "inherent") semantic incompleteness of the…

综合数学 · 数学 2016-02-11 Giuseppe Raguní

We show that G\"odel's negative results concerning arithmetic, which date back to the 1930s, and the ancient "sand pile" paradox (known also as "sorites paradox") pose the questions of the use of fuzzy sets and of the effect of a measuring…

综合物理 · 物理学 2015-06-04 V. P. Maslov

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

逻辑 · 数学 2015-08-20 M. Malliaris , S. Shelah

In what follows, essentially two things will be accomplished: Firstly, it will be proven that a version of the Arzel\`a--Ascoli theorem and the Fr\'echet--Kolmogorov theorem are equivalent to the axiom of countable choice for subsets of…

逻辑 · 数学 2018-03-23 Adrian Fellhauer

Inspired by Zermelo's quasi-categoricity result characterizing the models of second-order Zermelo-Fraenkel set theory $\text{ZFC}_2$, we investigate when those models are fully categorical, characterized by the addition to $\text{ZFC}_2$…

逻辑 · 数学 2022-03-25 Joel David Hamkins , Hans Robin Solberg

ZF is a well investigated impredicative constructive version of Zermelo-Fraenkel set theory. Using set terms, we axiomatize IZF with Replacement, which we call \izfr, along with its intensional counterpart \iizfr. We define a typed lambda…

计算机科学中的逻辑 · 计算机科学 2019-03-14 Wojciech Moczydlowski

The famous G\"odel incompleteness theorem says that for every sufficiently rich formal theory (containing formal arithmetic in some natural sense) there exist true unprovable statements. Such statements would be natural candidates for being…

逻辑 · 数学 2011-10-18 Alexander Shen

We discuss the problems of incompleteness and inexpressibility. We introduce almost self-referential formulas, use them to extend set theory, and relate their expressive power to that of infinitary logic. We discuss the nature of proper…

逻辑 · 数学 2016-12-20 Dmytro Taranovsky

We study recursively defined functions associated with directed graphs on the k dimensional nonnegative integral lattice. The existence of certain combinatorial structures associated with these function classes are shown to be independent…

组合数学 · 数学 2017-08-29 S. Gill Williamson

Mathematicians and philosophers have appealed to categoricity arguments in a surprisingly varied range of contexts. One familiar example calls on second-order categoricity in an attempt to show that the Continuum Hypothesis, despite its…

逻辑 · 数学 2023-03-14 Penelope Maddy , Jouko Väänänen

The literature dealing with G\"{o}del's legacy is largely preoccupied with challenging his philosophical views, regarding them as outdated. We believe that such an approach prevents us from seeing G\"{o}del's views in the right light and…

历史与综述 · 数学 2024-06-12 Jovana Kostić , Slobodan Vujošević

There are different meanings of foundation of mathematics: philosophical, logical, and mathematical. Here foundations are considered as a theory that provides means (concepts, structures, methods etc.) for the development of whole…

逻辑 · 数学 2007-05-23 Mark Burgin