Zobrazeno 1 - 10
of 27 206
pro vyhledávání: '"Mathematics - Logic"'
Autor:
Brian, Will, Farah, Ilijas
A trivial automorphism of the Boolean algebra $\mathcal P(\mathbb N) / \mathrm{Fin}$ is an automorphism induced by the action of some function $\mathbb N \rightarrow \mathbb N$. In models of forcing axioms all automorphisms are trivial, and therefore
Externí odkaz:
http://arxiv.org/abs/2410.08789
Autor:
Inamdar, Tanmay, Rinot, Assaf
It is proved that if there is an $\aleph_2$-Aronszajn line, then there is one that does not contain an $\aleph_2$-Countryman line. This solves a problem of Moore and stands in a sharp contrast with his Basis Theorem for linear orders of size $\aleph_
Externí odkaz:
http://arxiv.org/abs/2410.08757
We present three models concerning Tukey types of ultrafilters on $\omega$. The first model is built via a countable support iteration, and we show there is no basically generated ultrafilter in such model. The second and third models are built upon
Externí odkaz:
http://arxiv.org/abs/2410.08699
Autor:
Yang, Fan
The languages of logics based on team semantics typically only allow atomic negation or restricted negation. In this paper, we explore propositional team-based logics with full (intuitionistic) negation. We demonstrate that including full intutionist
Externí odkaz:
http://arxiv.org/abs/2410.08413
Autor:
Toader, Iulian D.
Most believe that there are no empirical grounds that make the adoption of quantum logic necessary. Ian Rumfitt has further argued that this adoption is not possible, either, for the proof that distribution fails in quantum mechanics is rule-circular
Externí odkaz:
http://arxiv.org/abs/2410.06588
Autor:
Keith, Jonathan M.
Upper asymptotic density induces a pseudometric on the power set of the natural numbers, with respect to which $P(\mathbb{N})$ is complete. The collection $D$ of sets with asymptotic density is closed in this pseudometric, and closed subsets of $D$ a
Externí odkaz:
http://arxiv.org/abs/2410.06559
Autor:
Anttila, Aleksi
The dual or game-theoretical negation $\lnot$ of independence-friendly logic (IF) and dependence logic (D) exhibits an extreme degree of semantic indeterminacy in that for any pair of sentences $\phi$ and $\psi$ of IF/D, if $\phi$ and $\psi$ are inco
Externí odkaz:
http://arxiv.org/abs/2410.07067
Autor:
Marcone, Alberto, Osso, Gian Marco
This paper classifies different fragments of the Galvin-Prikry theorem, an infinite dimensional generalization of Ramsey's theorem, in terms of their uniform computational content (Weihrauch degree). It can be seen as a continuation of arXiv:2003.042
Externí odkaz:
http://arxiv.org/abs/2410.06928
We explore two constructions of oligomorphic Jordan permutation groups preserving a `limit of betweenness relations' and a `limit of $D$-relations', from \cite{bhattmacph2006jordan} and \cite{almazaydeh2021jordan} respectively. Several issues left op
Externí odkaz:
http://arxiv.org/abs/2410.05832
Autor:
Benhamou, Tom
We characterize the Tukey order, the Galvin property/Cohesive ultrafilters from \cite{Kanamori1978} in terms of ultrapowers. We use this characterization to measure the distance between the Tukey order and other well-known orders of ultrafilters. Sec
Externí odkaz:
http://arxiv.org/abs/2410.06275