Related papers: Combinatorial principles equivalent to weak induct…
Let WO$(\omega^\omega)$ be the statement that the ordinal number $\omega^\omega$ is well ordered. WO$(\omega^\omega)$ has occurred several times in the reverse-mathematical literature. The purpose of this expository note is to discuss the…
In this paper the lightface $\Pi^{1}_{1}$-Comprehension axiom is shown to be proof-theoretically strong even over $\mbox{RCA}_{0}^{*}$, and we calibrate the proof-theoretic ordinals of weak fragments of the theory $\mbox{ID}_{1}$ of…
We study propositional proof systems with inference rules that formalize restricted versions of the ability to make assumptions that hold without loss of generality, commonly used informally to shorten proofs. Each system we study is built…
We examine the Lorentz non-invariance ambiguity in longitudinal weak-boson scatterings and the precise conditions for the validity of the Equivalence Theorem (ET). {\it Safe} Lorentz frames for applying the ET are defined, and the intrinsic…
A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…
We study the logical content of several maximality principles related to the finite intersection principle ($F\IP$) in set theory. Classically, these are all equivalent to the axiom of choice, but in the context of reverse mathematics their…
We present updates on the cosmology inference using the effective field theory (EFT) likelihood presented previously in Schmidt et al., 2018, Elsner et al., 2019 [1,2]. Specifically, we add a cutoff to the initial conditions that serve as…
Fekete's lemma is a well known result from combinatorial mathematics that shows the existence of a limit value related to super- and subadditive sequences of real numbers. In this paper, we analyze Fekete's lemma in view of the arithmetical…
A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTTO and LTTO*, which we claim correspond closely to the classical predicative…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
The uniform Kruskal theorem extends the original result for trees to general recursive data types. As shown by A. Freund, M. Rathjen and A. Weiermann, it is equivalent to $\Pi^1_1$-comprehension, over $\mathsf{RCA_0}$ with the chain…
The heterogeneity of composite leads to the extra charge concentration at the boundaries of different phases that results essentially nonzero effective electric susceptability. The relation between tensors of effective electric…
We formulate a framework for describing behaviour of effectful higher-order recursive programs. Examples of effects are implemented using effect operations, and include: execution cost, nondeterminism, global store and interaction with a…
In the former article "Formal mathematical systems including a structural induction principle" we have presented a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the…
We show that Brown's lemma is equivalent to Sigma02-induction over RCA0* and that the finite version of Brown's lemma is provable in RCA0 but not in RCA0*.
We show the validity of some results of finite-time thermodynamics, also within the quasi-static framework of classical thermodynamics. First, we consider the efficiency at maximum work (EMW) from finite source and sink modelled as…
We study the complexity of proof systems augmenting resolution with inference rules that allow, given a formula $\Gamma$ in conjunctive normal form, deriving clauses that are not necessarily logically implied by $\Gamma$ but whose addition…
It is shown that Vop\v{e}nka's Principle (VP) can restore almost the entire ZF over a weak fragment of it. Namely, if EST is the theory consisting of the axioms of Extensionality, Empty Set, Pairing, Union, Cartesian Product,…
Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original…
We present some contributions to the theory of infinitary rewriting for weakly orthogonal term rewrite systems, in which critical pairs may occur provided they are trivial. We show that the infinitary unique normal form property fails by an…