中文
相关论文

相关论文: Naturality and Definability II

200 篇论文

We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…

逻辑 · 数学 2019-01-29 Saharon Shelah

For a proper map $f\colon X\to Y$ of noetherian ordinary schemes, one has a well-known natural transformation, ${\bf L}^*f^*(-)\overset{\bf L}{\otimes} f^!{\mathcal{O}}_Y\to f^!$, obtained via the projection formula, which extends, using…

代数几何 · 数学 2019-05-16 Suresh Nayak , Pramathanath Sastry

We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.

逻辑 · 数学 2007-05-23 Peter Koepke , Martin Koerwien

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 investigate a number of semantically defined fragments of Tarski's algebra of binary relations, including the function-preserving fragment. We address the question whether they are generated by a finite set of operations. We obtain…

计算机科学中的逻辑 · 计算机科学 2024-09-11 Bart Bogaerts , Balder ten Cate , Brett McLean , Jan Van den Bussche

We examine the Zermelo Fraenkel set theory with Choice (ZFC) enhanced by one of the (structural) reflection principles down to a small cardinal and/or Recurrence Axioms defined below. The strongest forms of reflection principles spotlight…

逻辑 · 数学 2024-10-29 Sakaé Fuchino

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…

逻辑 · 数学 2012-06-12 Andreas Fackler

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

All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…

综合数学 · 数学 2025-05-28 Stanislav Semenov

We discuss some highlights of our computer-verified proof of the construction, given a countable transitive set-model $M$ of $\mathit{ZFC}$, of generic extensions satisfying $\mathit{ZFC}+\neg\mathit{CH}$ and $\mathit{ZFC}+\mathit{CH}$.…

It is well known that ZFC, despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the…

综合数学 · 数学 2021-06-15 Marcoen J. T. F. Cabbolet

This paper deals with $n$-dimensional algebras, over any field, which have only trivial derivation (automorphism) and simple algebras. It is shown that the corresponding sets of algebras are not empty and, in algebraically closed field…

环与代数 · 数学 2025-03-12 U. Bekbaev

We prove that a large class of natural transformations (consisting roughly of those constructed via composition from the "functorial" or "base change" transformations) between two functors of the form $\cdots f^* g_* \cdots$ actually has…

代数几何 · 数学 2014-04-17 Ryan Cohen Reich

This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…

计算机科学中的逻辑 · 计算机科学 2023-03-31 Miguel Campercholi , Mauricio Tellechea , Pablo Ventura

In this paper, we build Fidel-structures valued models following the methodology developed for Heyting-valued models; recall that Fidel structures are not algebras in the universal algebra sense. Taking models that verify Leibniz law, we…

逻辑 · 数学 2022-10-18 Aldo Figallo-Orellano , Juan Sebastian Slagter

While non-contextual hidden-variable theories are proved to be impossible, contextual ones are possible. In a contextual hidden-variable theory, an observable is called a beable if the hidden-variable assigns its value in a given…

量子物理 · 物理学 2023-11-17 Masanao Ozawa

We consider interpretable topological spaces and topological groups in a $p$-adically closed field $K$. We identify a special class of "admissible topologies" with topological tameness properties like generic continuity, similar to the…

逻辑 · 数学 2022-08-23 Will Johnson

We show that there is a $\beta$-model of second-order arithmetic in which the choice scheme holds, but the dependent choice scheme fails for a $\Pi^1_2$-assertion, confirming a conjecture of Stephen Simpson. We obtain as a corollary that…

逻辑 · 数学 2018-08-16 Sy-David Friedman , Victoria Gitman , Vladimir Kanovei

A visceral structure on M is given by a definable base for a uniform topology on its universe in which all basic open sets are infinite and any infinite definable subset X of M has non-empty interior. This context includes o-minimal ordered…

逻辑 · 数学 2021-10-15 Alfred Dolich , John Goodrick