Related papers: Normalization of IZF with Replacement
The representation theorem for odd or even involutive FLe-chains by bunches of layer groups, as discussed in [10], is redefined to demonstrate a more straightforward constructional relationship between odd or even involutive FLe-chains and…
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…
We introduce a new model construction for Martin-L\"{o}f intensional type theory, which is sound and complete for the 1-truncated version of the theory. The model formally combines the syntactic model with a notion of realizability; it also…
We show how one may establish proof-theoretic results for constructive Zermelo-Fraenkel set theory, such as the compactness rule for Cantor space and the Bar Induction rule for Baire space, by constructing sheaf models and using their…
Using techniques developed in the revision theory of truth, I build a model for the set theory NF (New Foundations) developed by Quine in ZF, therefore proving its consistency relative to ZF. The model is essentially a term model; the sets…
We present a typing system with non-idempotent intersection types, typing a term syntax covering three different calculi: the pure {\lambda}-calculus, the calculus with explicit substitutions {\lambda}S, and the calculus with explicit…
We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…
Let f be a modular form of weight 2 and trivial character. Fix also an imaginary quadratic field K. We use work of Bertolini-Darmon and Vatsal to study the mu-invariant of the p-adic Selmer group of f over the anticyclotomic Zp-extension of…
Formal transformations somehow resembling the usual derivative are surprisingly common in computer science, with two notable examples being derivatives of regular expressions and derivatives of types. A newcomer to this list is the…
In this paper we introduce a new infinite set of transcendental integrals. Each of them is expressed by corresponding value of the function $|\zf|^{-2}$. Such a property is another argument about universality of the Riemann zeta-function…
The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…
We introduce a transformation of linear Pfaffian systems, which we call the middle Laplace transform, as a formulation of the Laplace transform from the perspective of Katz theory. While the definition of the middle Laplace transform is…
This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory. The first part of the work on models of set theory consists in establishing a refined version of Friedman's theorem on…
We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the…
The Test Template Framework (TTF) is a model-based testing method for the Z notation. In the TTF, test cases are generated from test specifications, which are predicates written in Z. In turn, the Z notation is based on first-order logic…
We look at explicit ways to bring one or two antiunitary symmetries into a standard form via unitary conjugation. We carefully reproduce Wigner's proof in two special cases, where the antiunitary operators square to $+I$, or to $-I$.…
Fokker-Planck equations have been applied in the past to field theory topics such as the stochastic quantization and the stabilization of bottomless action theories. In this paper we give another application of the FP-techniques in a way…
Let $\Lambda = \{\lambda_{k}\}$ denote a sequence of complex numbers and assume that that the counting function $#\{\lambda_{k} \in \Lambda : | \lambda_{k}| < T\} =O(T^{n})$ for some integer $n$. From Hadamard's theorem, we can construct an…
The lambda calculus is a widely accepted computational model of higher-order functional pro- grams, yet there is not any direct and universally accepted cost model for it. As a consequence, the computational difficulty of reducing lambda…
Recently, the Elementary Process Theory (EPT) has been developed as a set of fundamental principles that might underlie a gravitational repulsion of matter and antimatter. This paper presents set matrix theory (SMT) as the foundation of the…