Related papers: Un Crit{\`E}Re Simple
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlying a theorem prover. We also show a close relation with the…
The Abella interactive theorem prover has proven to be an effective vehicle for reasoning about relational specifications. However, the system has a limitation that arises from the fact that it is based on a simply typed logic:…
The motivation for this paper is to extend the known model theoretic treatment of differential Galois theory to the case of linear difference equations (where the derivative is replaced by an automorphism.) The model theoretic difficulties…
We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…
Proof schemata are infinite sequences of proofs which are defined inductively. In this paper we present a general framework for schemata of terms, formulas and unifiers and define a resolution calculus for schemata of quantifier-free…
A cycle is algebraically trivial if it can be exhibited as the difference of two fibers in a family of cycles parameterized by a smooth scheme. Over an algebraically closed field, it is a result of Weil that it suffices to consider families…
The generally accepted wisdom in computational circles is that pure proof verification is a solved problem and that the computationally hard elements and fertile areas of study lie in proof discovery. This wisdom presumably does hold for…
We study the codegree isomorphism problem for finite simple groups. In particular, we show that such a group is determined by the codegrees (counting multiplicity) of its irreducible characters. The proof is uniform for all simple groups…
Let M be ternary, homogeneous and simple. We prove that if M is finitely constrained, then it is supersimple with finite SU-rank and dependence is $k$-trivial for some $k < \omega$ and for finite sets of real elements. Now suppose that, in…
We continue our analysis of establishing the reliability of "simple" effective theories where massive fields are "frozen" rather than integrated out, in a wide class of four dimensional theories with global or local N=1 supersymmetry. We…
Effective field theories (EFTs) are widely considered by physicists to be explanatory and to be the appropriate frameworks for modelling various phenomena at different scales. At the same time, they are known to be approximate, restricted,…
Forking is a central notion of model theory, generalizing linear independence in vector spaces and algebraic independence in fields. We develop the theory of forking in abstract, category-theoretic terms, for reasons both practical (we…
We present a comprehensive discussion of the consistency of the effective quantum field theory of a single $Z_2$ symmetric scalar field. The theory is constructed from a bare Euclidean action which at a scale much greater than the…
We prove that the C*-algebra of a second-countable, \'etale, amenable groupoid is simple if and only if the groupoid is topologically principal and minimal. We also show that if G has totally disconnected unit space, then the associated…
We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice…
I argue that, contrary to the standard view, one cannot understand the structure and nature of our knowledge in physics without an analysis of the way that observers (and, more generally, measuring instruments and experimental arrangements)…
This short article contains the construction of a construction that generalizes the concept of the derivative of a function of one variable, using the theory of filters. The paper presents a new concept, demonstrates that it really…
We show that time complexity analysis of higher-order functional programs can be effectively reduced to an arguably simpler (although computationally equivalent) verification problem, namely checking first-order inequalities for validity.…
We propose a categorical framework to reason about scientific explanations: descriptions of a phenomenon meant to translate it into simpler terms, or into a context that has been already understood. Our motivating examples come from systems…
The consistency formula for set theory can be stated in terms of the free-variables theory of primitive recursive maps. Free-variable p. r. predicates are decidable by set theory, main result here, built on recursive evaluation of p. r. map…