English
Related papers

Related papers: Towards computable analysis on the generalised rea…

200 papers

Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and…

Logic · Mathematics 2007-05-23 Joel David Hamkins

Let $\kappa$,$\lambda$ be regular uncountable cardinals such that $\lambda > \kappa^+$ is not a successor of a singular cardinal of low cofinality. We construct a generic extension with $s(\kappa) = \lambda$ starting from a ground model in…

Logic · Mathematics 2015-08-18 Omer Ben-Neria , Moti Gitik

We prove several results giving lower bounds for the large cardinal strength of a failure of the singular cardinal hypothesis. The main result is the following theorem: Theorem: Suppose $\kappa$ is a singular strong limit cardinal and…

Logic · Mathematics 2016-09-06 Moti Gitik , William Mitchell

For every uncountable cardinal $\kappa$ there are $2^\kappa$ nonisomorphic simple AF algebras of density character $\kappa$ and $2^\kappa$ nonisomorphic hyperfinite II$_1$ factors of density character $\kappa$. These estimates are maximal…

Operator Algebras · Mathematics 2013-01-28 Ilijas Farah , Takeshi Katsura

Given a strong limit cardinal $\lambda$ of countable cofinality, we show that if every $\lambda$-coanalytic subset of the generalised Cantor space ${}^{\lambda}2$ has the $\lambda$-$\mathsf{PSP}$, then there is an inner model with…

Logic · Mathematics 2025-04-23 Fernando Barrera , Vincenzo Dimonte , Sandra Müller

We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to generalize known constructs involving relativized unambiguity based complexity classes (UP and \mathcal{UP}) to new constructs…

Computational Complexity · Computer Science 2007-05-23 Holger Spakowski , Rahul Tripathi

From a suitable large cardinal hypothesis, we provide a model with a supercompact cardinal in which universal indestructibility holds: every supercompact and partially supercompact cardinal kappa is fully indestructible by kappa-directed…

Logic · Mathematics 2007-05-23 Arthur W. Apter , Joel David Hamkins

Using complex methods combined with Baire's Theorem we show that one-sided extendability, extendability and real analyticity are rare phenomena on various spaces of functions in the topological sense. These considerations led us to…

Complex Variables · Mathematics 2018-04-03 E. Bolkas , V. Nestoridis , C. Panagiotis , M. Papadimitrakis

Let $\kappa$ be any regular cardinal. Assuming the existence of a huge cardinal above $\kappa$, we prove the consistency of $\binom{\kappa^{++}}{\kappa^+}\rightarrow\binom{\tau}{\kappa^+}$ for every ordinal $\tau<\kappa^{++}$. Likewise, we…

Logic · Mathematics 2017-02-21 Shimon Garti

We unify kappa-Minkowki spacetime and Lorentz algebra in unique Lie algebra. Introducing commutative momenta, a family of kappa-deformed Heisenberg algebras and kappa-deformed Poincare algebras are defined. They are specified by the matrix…

Mathematical Physics · Physics 2015-05-30 Domagoj Kovačević , Stjepan Meljanac

We revisit the old work of de Paiva on the models of the Lambek Calculus in dialectica models making sure that the syntactic details that were sketchy on the first version got completed and verified. We extend the Lambek Calculus with a…

Logic in Computer Science · Computer Science 2018-01-23 Valeria de Paiva , Harley Eades

We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$…

Logic · Mathematics 2020-02-19 Dag Normann , Sam Sanders

We deal with (< kappa)-supported iterated forcing notions which are (E_0,E_1)-complete, have in mind problems on Whitehead groups, uniformizations and the general problem. We deal mainly with the successor of a singular case. This continues…

Logic · Mathematics 2016-09-07 Saharon Shelah

We introduce the operators "modified limit" and "accumulation" on a Banach space, and we use this to define what we mean by being internally computable over the space. We prove that any externally computable function from a computable…

Logic · Mathematics 2015-07-01 Dag Normann

First derivatives with respect to the parameters of the Whittaker function $\mathrm{W}_{\kappa ,\mu }\left( x\right) $ are calculated. Using the confluent hypergeometric function, these derivarives can be expressed as infinite sums of…

Classical Analysis and ODEs · Mathematics 2023-04-28 Alexander Apelblat , Juan Luis González-Santander

We describe the basic theory of infinite time Turing machines and some recent developments, including the infinite time degree theory, infinite time complexity theory, and infinite time computable model theory. We focus particularly on the…

Logic · Mathematics 2019-08-16 Samuel Coskey , Joel David Hamkins

This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running…

Computational Complexity · Computer Science 2017-06-02 Akitoshi Kawamura , Florian Steinberg

Let kappa a regular uncountable cardinal and lambda a cardinal >kappa, and suppose lambda^{<kappa} is less than the covering number for category cov(M_{kappa,kappa}). Then (a) I_{kappa,lambda}^+ -->^kappa (I_{kappa, lambda}^+,omega +1)^2,…

Logic · Mathematics 2007-05-23 Pierre Matet , Saharon Shelah

We develop a unified framework for iterated symmetric extensions with countable support and, more generally, with $<\kappa$-support. Set-length iterations are treated uniformly, and when the iteration template is first-order definable over…

Logic · Mathematics 2026-01-26 Frank Gilson

We show that if the universe is self-iterable and $\kappa$ is an inaccessible limit of Woodin cardinal then $AD_R + "\Theta$ is regular" holds in the derived model at $\kappa$. The proof is fine-structure free, and only assumes basic…

Logic · Mathematics 2021-11-15 Grigor Sargsyan , Takehiko Gappo