Related papers: Set-theoretic reflection is equivalent to inductio…
We introduce real induction, a proof technique analogous to mathematical induction but applicable to statements indexed by an interval on the real line. More generally we give an inductive principle applicable in any Dedekind complete…
We introduce a formal language GDST (gradualist descriptionalist set theory) with a family of interpretations indexed by ordinals, as well as a sublanguage NMID (the language of not necessarily monotonic inductive definitions), and show…
We find a possible interpretation of Henkin's Theorem in the language of existential implicational doctrines. Under some smallness assumption, starting from an implicational existential doctrine, with non-trivial fibers, we construct a new…
A selection of the relevant theorems of Probability Theory that comes directly from Kolmogorov's axioms, Set Theory basic results, definitions and rules of inference are listed and proven in a systematic approach, aiming the student who…
We investigate the reflection theory of Nichols algebras over arbitrary coquasi-Hopf algebras with bijective antipode, generalizing previous results restricted to the pointed cosemisimple setting [47]. By establishing a braided monoidal…
We prove that $\delta$-derivations of a simple finite-dimensional Lie algebra over a field of characteristic zero, with values in a finite-dimensional module, are either inner derivations, or, in the case of adjoint module, multiplications…
In reference [8] we have considered a wide class of "well-behaved" reducibilities for sets of reals. In this paper we continue with the study of Borel reducibilities by proving a dichotomy theorem for the degree-structures induced by good…
For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…
We give a simple proof that the first-order theory of well orders is axiomatized by transfinite induction, and that it is decidable.
We provide an explicit characterization of the properties of primitive recursive functions that are decidable or semi-decidable, given a primitive recursive index for the function. The result is much more general as it applies to any c.e.…
The purpose of this paper is to introduce the concept of reflecting numbers to the realm of number theory and to classify reflecting numbers of certain types. For us, reflecting numbers are coming from congruent numbers, above congruent…
In 2002, Terao showed that every reflection multi-arrangement of a real reflection group with constant multiplicity is free by providing a basis of the module of derivations. We first generalize Terao's result to multi-arrangements stemming…
We establish a framework with reflection positivity as the first principle for establishing the boundary theory of topologically ordered quantum spin systems. For any reflection positive frustration-free Hamiltonian, We proved that the…
It is shown that Vop\v{e}nka's Principle (VP) can restore almost the entire ZF over a weak fragment of it. Namely, if EST is the theory consisting of the axioms of Extensionality, Empty Set, Pairing, Union, Cartesian Product,…
A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…
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…
In this paper we show that using implicative algebras one can produce models of set theory generalizing Heyting/Boolean-valued models and realizability models of (I)ZF, both in intuitionistic and classical logic. This has as consequence…
Starting from infinitely many supercompact cardinals, we force a model of ZFC where $\aleph_{\omega^2+1}$ satisfies simultaneously a strong principle of reflection, called $\Delta$-reflection, and a version of the square principle, denoted…
We show that the theory $I\Sigma_1$ of $\Sigma_1$-induction proves the following statement: For all $n\geq 2$, the uniform $\Sigma_1$-reflection principle over the theory $I\Sigma_n$ is equivalent to the totality of the function…
Theory revision integrates inductive learning and background knowledge by combining training examples with a coarse domain theory to produce a more accurate theory. There are two challenges that theory revision and other theory-guided…