相关论文: The strength of replacement in weak arithmetic

We investigate how to model exchangeability with choice functions. Exchangeability is a structural assessment on a sequence of uncertain variables. We show how such assessments are a special indifference assessment, and how that leads to a…

The (extensional) theory of arrays is widely used to model systems. Hence, efficient decision procedures are needed to model check such systems. Current decision procedures for the theory of arrays saturate the read-over-write and…

The article introduces the concept of uniformity, which is formulated as a scheme of axioms. The connection of this concept with ordered sets is studied. The effectiveness of using axiom schemes as a convenient and short way of replacing…

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…

In the context of $\mathsf{ZF}$, we analyze a version of Hindman's finite unions theorem on infinite sets, which normally requires the Axiom of Choice to be proved. We establish the implication relations between this statement and various…

A folk theorem says higher order arithmetic has the proof theoretic strength of set theory with limited power set. This paper makes the theorem precise in terms of several axiom system based on ZF.

In order to make argumentation-based inference contestable, it is crucial to explain what changes can achieve a desired (instead of the contested) inference result. To this end, we introduce strength change explanations for quantitative…

We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear…

We extend the usual internal logic of a (pre)topos to a more general interpretation, called the stack semantics, which allows for "unbounded" quantifiers ranging over the class of objects of the topos. Using well-founded relations inside…

In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…

We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result…

We deal with relatives of GCH which are provable. In particular we deal with rank version of the revised GCH. Our motivation was to find such results when only weak versions of the axiom of choice are assumed but some of the results gives…

Weak measurement of a quantum system followed by postselection based on a subsequent strong measurement gives rise to a quantity called the weak value: a complex number for which the interpretation has long been debated. We analyse the…

We provides some new equivalent forms of collection principle over some very weak set theories after reviewing the existing ones.

For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…

We extend de Finetti's [Ann. Inst. H. Poincar\'{e} 7 (1937) 1--68] notion of exchangeability to finite and countable sequences of variables, when a subject's beliefs about them are modelled using coherent lower previsions rather than…

We determine the proof-theoretic strength of the principle of countable saturation in the context of the systems for nonstandard arithmetic introduced in our earlier work.

The notion of weak measurement provides a formalism for extracting information from a quantum system in the limit of vanishing disturbance to its state. Here we extend this formalism to the measurement of sequences of observables. When…

We show in Bishop's constructive mathematics---in particular, using countable choice---that weak K\"{o}nig's lemma implies the uniform continuity theorem.

This note presents a unified theorem of the alternative that explicitly allows for any combination of equality, componentwise inequality, weak dominance, strict dominance, and nonnegativity relations. The theorem nests 60 special cases,…