Related papers: On Goodman realizability

We prove a conjecture of Lehmann-Tanimoto about the behaviour of the Fujita invariant (or $a$-constant appearing in Manin's conjecture) under pull-back to generically finite covers. As a consequence we obtain results about geometric…

Combining recent results on noetherianity of twisted commutative algebras by Draisma and the resolution of Stillman's conjecture by Ananyan-Hochster, we prove a broad generalization of Stillman's conjecture. Our theorem yields an array of…

In this paper we adopt a geometric point of view regarding a famous conjecture due to Littlewood in diophantine approximation of real numbers. Following the spirit of the geometric theory of continued fractions, we give a sufficient…

Recently a new type of central limit theorem for belief functions was given in Epstein et al. [9]. In this paper, we generalize the central limit theorem in Epstein et al. [9] to accommodate general bounded random variables. These results…

The paper studies the notion of supposition encoded in non-Archimedean conditional probability (and revealed in the acceptance of the so-called indicative conditionals). The notion of qualitative change of view that thus arises is…

Using a result of recursive function theory and results of the complex analysis of Takeuti, which is based on a type theory and the work of Kreisel, and which gives a conservative extension of first order Peano arithmetic (PA), assuming all…

The theory of classical realizability is a framework in which we can develop the proof-program correspondence. Using this framework, we show how to transform into programs the proofs in classical analysis with dependent choice and the…

The Myhill isomorphism is a variant of the Cantor-Bernstein theorem. It states that, from two injections that reduces two subsets of $\mathbb{N}$ to each other, there exists a bijection $\mathbb{N} \to \mathbb{N}$ that preserves them. This…

Following the successful construction of the finite T real-time formalism in temporal axial gauge, we attempt to further study the equivalent new imaginary-time formalism of James and Landshoff based on the same Hamiltonian approach in the…

Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as $\SigmaPtwo$-complete, and the complexity of the credulous and skeptical…

We provide a Kingman-like Theorem for arbitrary finite measures and a version of Birkhoff's Theorem for bounded observable. As an application, we show that Birkhoff's limit exists for some continuous observable, in an example of Bowen.

It was proved by Maksimova in 1977 that exactly eight varieties of Heyting algebras have the amalgamation property, and hence exactly eight axiomatic extensions of intuitionistic propositional logic have the deductive interpolation…

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…

For each $f:[0,\infty)\to\Com$ formally consider its co-Poisson or M\"{u}ntz transform $g(x)=\sum_{n\geq 1}f(nx)-\frac{1}{x}\int_0^\infty f(t)dt$. For certain $f$'s with both $f, g \in L_2(0,\infty)$ it is true that the Riemann hypothesis…

Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…

We revisit a theorem of Grosshans and show that it holds over arbitrary commutative base ring $k$. One considers a split reductive group scheme $G$ acting on a $k$-algebra $A$ and leaving invariant a subalgebra $R$. If $R^U=A^U$ then the…

In 1938, Tarski proved that a formula is not intuitionistically valid if, and only if, it has a counter-model in the Heyting algebra of open sets of some topological space. In fact, Tarski showed that any Euclidean space R^n with n >= 1…

We consider controllability for divergence-free systems that have a conserved quantity and satisfy a H\"ormander condition. It is shown that such systems are controllable, provided that the conserved quantity is a proper function. The proof…

In 1999, Iwan Duursma defined the zeta function for a linear code as a generating function of its Hamming weight enumerator. It can also be defined for other homogeneous polynomials not corresponding to existing codes. If the homogeneous…

This thesis focuses on modifications on Einstein's theory of General Relativity, which could explain the current problems in gravitation and cosmology. More specifically, modifications of the affine structure of the spacetime, which is the…