Related papers: Permanence as a Principle of Practice
By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…
We introduce a variation on Barthe et al.'s higher-order logic in which formulas are interpreted as predicates over open rather than closed objects. This way, concepts which have an intrinsically functional nature, like continuity,…
We refer here to the surprising construction made by Giuseppe Peano in 1890. He gave an example of a continuous function (called now the Peano curve) from the unit interval to the whole unit square. We show here the existence of a more…
A central problem in proof-theory is that of finding criteria for identity of proofs, that is, for when two distinct formal derivations can be taken as denoting the same logical argument. In the literature one finds criteria which are…
This paper considers proof-theoretic semantics for necessity within Dummett's and Prawitz's framework. Inspired by a system of Pfenning's and Davies's, the language of intuitionist logic is extended by a higher order operator which captures…
A 1976 result from Norton may be used to give an asymptotic (but not explicit) description of the constant in Mertens' second theorem for primes in arithmetic progressions. Assuming the Generalized Riemann Hypothesis, we give an effective…
The basic notions of logic-predicate logic, Peano arithmetic, incompleteness theorems, etc.-have for long been an advanced topic. In the last decades, they became more widely taught, inphilosophy, mathematics, and computer science…
Peano Arithmetic is known to be provably equivalent to reflection over Elementary Arithmetic. We prove a characterization of Predicative Analysis in the guise of ATR0 in terms of stronger reflection principles.
We consider the classical concept of time of permanence and observe that its quantum equivalent is described by a bona fide self-adjoint operator. Its interpretation, by means of the spectral theorem, reveals that we have to abandon not…
Ioffe's criterion and various reformulations of it have become a~standard tool in proving theorems guaranteeing metric regularity of a (set-valued) mapping. First, we demonstrate that one should always use directly the so-called general…
This is an English (annotated) translation of the German paper by Max Planck (1887) about "The principle of the conservation of energy"
We study rationality properties of irreducible characters of finite groups. We show that the continuity of $2$-rationality is a phenomenon that can be detected in the principal $2$-block, thus refining a recent result of N. N. Hung. We also…
In a forthcoming book, professional computer scientist and physicist Paul Budnik presents an exposition of classical mathematical theory as the backdrop to an elegant thesis: we can interpret any model of a formal system of Peano Arithmetic…
Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently launched program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally…
The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sphere models for counterfactual logics, is proposed. Soundness…
The problem of induction has persisted since Hume exposed the logical gap between repeated observation and universal inference. Traditional attempts to resolve it have oscillated between two extremes: the probabilistic optimism of Laplace…
The Principle of Relativity has so far been understood as the {\it covariance} of laws of Physics with respect to a general class of reference frame transformations. That relativity, however, has only been expressed with the help of {\it…
In his Discourse on the Method of Rightly Conducting the Reason, and Seeking Truth in the Sciences, Rene Descartes sought ``clear and certain knowledge of all that is useful in life.'' Almost three centuries later, in ``The foundations of…
We show how to force, with finite conditions, the forcing axiom PFA(T), a relativization of PFA to proper forcing notions preserving a given Souslin tree T. The proof uses a Neeman style iteration with generalized side conditions consisting…
We advance a general theory of coherent preference that surrenders restrictions embodied in orthodox doctrine. This theory enjoys the property that any preference system admits extension to a complete system of preferences, provided it…