Related papers: Higher Cardinals are only a Convention
If V is a representation of a linear algebraic group G, a set S of G-invariant regular functions on V is called separating if the following holds: If two elements v,v' from V can be separated by an invariant function, then there is an f…
We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…
Starting from a generalization of the standard axioms for a monoid we present a stepwise development of various, mutually equivalent foundational axiom systems for category theory. Our axiom sets have been formalized in the Isabelle/HOL…
Given a graded sequence of ideals (a_m) on a smooth variety $X$ having finite log canonical threshold, suppose that for every m we have a divisor E_m over X that computes the log canonical threshold of a_m, and such that the log…
We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…
We define ranks and degrees for families of theories, similar to Morley rank and degree, as well as Cantor-Bendixson rank and degree, and the notion of totally transcendental family of theories. Bounds for $e$-spectra with respect to ranks…
In 1985, Yu. V. Nesterenko produced a criterion for linear independence, which is a variant of Siegel's. While Siegel uses upper bounds on full systems of forms, Nesterenko uses upper and lower bounds on sufficiently dense sequences of…
We study general methods to build forking-like notions in the framework of tame abstract elementary classes (AECs) with amalgamation. We show that whenever such classes are categorical in a high-enough cardinal, they admit a good frame: a…
This paper examines the possibilities of extending Cantor's two arguments on the uncountable nature of the set of real numbers to one of its proper denumerable subsets: the set of rational numbers. The paper proves that, unless certain…
Canonical inference rules and canonical systems are defined in the framework of non-strict single-conclusion sequent systems, in which the succeedents of sequents can be empty. Important properties of this framework are investigated, and a…
Higher order derivatives of functions are structured high dimensional objects which lend themselves to many alternative representations, with the most popular being multi-index, matrix and tensor representations. The choice between them…
Given a class C of word languages, the C-separation problem asks for an algorithm that, given as input two regular languages, decides whether there exists a third language in C containing the first language, while being disjoint from the…
A typical kind of question in mathematical logic is that for the necessity of a certain axiom: Given a proof of some statement $\phi$ in some axiomatic system $T$, one looks for minimal subsystems of $T$ that allow deriving $\phi$. In…
We produce a model where every supercompact cardinal is $C^{(1)}$-supercompact with inaccessible targets. This is a significant improvement of the main identity-crises configuration obtained in \cite{HMP} and provides a definitive answer to…
F. Escalante and T. Gallai studied in the seventies the structure of different kind of separations and cuts between a vertex pair in a (possibly infinite) graph. One of their results is that if there is a finite separation, then the optimal…
Recently in Reference [ quant-ph/0202121] a computational criterion of separability induced by greatest cross norm is proposed by Rudolph. There, Rudolph conjectured that the new criterion is not weaker than positive partial transpose…
This paper contributes to the theory of large cardinals beyond the Kunen inconsistency, or choiceless large cardinal axioms, in the context where the Axiom of Choice is not assumed. The first part of the paper investigates a periodicity…
Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…
This tutorial deal with the Axiom of Choice and some of its applications to topics related to Computer Science. We will see that the Axiom of Choice is equivalent to some well-known proof principles like Zorn's Lemma or Tuckey's Maximality…
In this paper we show how the abstract behaviours of higher-order systems can be modelled as final coalgebras of suitable behavioural functors. These functors have the challenging peculiarity to be circularly defined with their own final…