Related papers: The Reduction Property Revisited
We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion…
Iterated reflection principles have been employed extensively to unfold epistemic commitments that are incurred by accepting a mathematical theory. Recently this has been applied to theories of truth. The idea is to start with a collection…
We develop a dependent type theory that is based purely on inductive and coinductive types, and the corresponding recursion and corecursion principles. This results in a type theory with a small set of rules, while still being fairly…
Lifting theorems are theorems that bound the communication complexity of a composed function $f\circ g^{n}$ in terms of the query complexity of $f$ and the communication complexity of $g$. Such theorems constitute a powerful generalization…
Utilizing the notion of property (T) we construct new examples of quantum group norms on the polynomial algebra of a compact quantum group, and provide criteria ensuring that these are not equal to neither the minimal nor the maximal norm.…
In this Part I, we shall prove the consistency of arithmetic without complete induction from a point of view of strong negation, using its embedding to the tableau system $\bf SN$ of constructive arithmetic with strong negation without…
Glivenko's theorem says that, in propositional logic, classical provability of a formula entails intuitionistic provability of double negation of that formula. We generalise Glivenko's theorem from double negation to an arbitrary nucleus,…
The postulates of comprehension and extensionality in set theory are based on an inversion principle connecting set-theoretic abstraction and the property of having a member. An exactly analogous inversion principle connects functional…
In this paper we explore the representation property over sets. This property generalizes constructibility, however is weak enough to enable us to prove that the class of theories $T$ whose models are representable is exactly the class of…
We study arithmetic distribution relations and the inverse function theorem in algebraic and arithmetic geometry, with an emphasis on versions that can be applied uniformly across families of varieties and maps. In particular, we prove two…
It is proposed that to the usual probability theory, three definitions and a new theorem are added, the resulting theory allows one to displace the central role usually given to the notion of conditional probability. When a mapping $\phi$…
The classical homomorphism preservation theorem, due to {\L}o\'s, Lyndon and Tarski, states that a first-order sentence $\phi$ is preserved under homomorphisms between structures if, and only if, it is equivalent to an existential positive…
Composite theories are the algebraic equivalent of distributive laws. In this paper, we delve into the details of this correspondence and concretely show how to construct a composite theory from a distributive law and vice versa. Using term…
In this article we prove a set of preservation properties of the reticulation functor for residuated lattices (for instance preservation of subalgebras, finite direct products, inductive limits, Boolean powers) and we transfer certain…
A strong direct product theorem states that if we want to compute $k$ independent instances of a function, using less than $k$ times the resources needed for one instance, then the overall success probability will be exponentially small in…
Within the program of finding axiomatizations for various parts of computability logic, it was proved earlier that the logic of interactive Turing reduction is exactly the implicative fragment of Heyting's intuitionistic calculus. That sort…
The goal of property testing is to quickly distinguish between objects which satisfy a property and objects that are $\epsilon$-far from satisfying the property. There are now several general results in this area which show that natural…
We argue that traditional formulations of the reduction thesis that tie it to privileged relational operations do not suffice for Peirce's justification of the categories, and invite the charge of gerrymandering to make it come out as true.…
This paper establishes necessary and sufficient conditions for a bi-amalgamation to inherit the arithmetical property, with applications on the weak global dimension and transfer of the semihereditary property. The new results compare to…
We propose Reduced Collatz Conjecture that is equivalent to Collatz Conjecture, which states that every positive integer can return to an integer less than it, instead of 1. Reduced Collatz Conjecture is easier to explore because certain…