Related papers: Comparing Hume's Principle, Basic Law V and Peano …
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…
We investigate the cyclic proof theory of extensions of Peano Arithmetic by (finitely iterated) inductive definitions. Such theories are essential to proof theoretic analyses of certain `impredicative' theories; moreover, our cyclic systems…
We suggest new types and interpretation of complex and hypercomplex numbers for which the commutative, associative, and distributive laws and the norm axioms are trivially satisfied.
A normative approach called Similarity Matching was recently introduced for deriving and understanding the algorithmic basis of neural computation focused on unsupervised problems. It involves deriving algorithms from computational…
A first-order Peano Arithmetical system with the operation of factorial (PAF) is introduced. For any formula A(x) with a free variable x in PAF, we define a corresponding B-formula which means that there exists unique number that is…
Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of…
We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to generalize known constructs involving relativized unambiguity based complexity classes (UP and \mathcal{UP}) to new constructs…
We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…
Based on Lagrange and Hermite interpolation two novel versions of weak form quadrature element are proposed for a non-classical Euler-Bernoulli beam theory. By extending these concept two new plate elements are formulated using…
While machine learning can accurately model process systems, models for decision making should also be structurally simple and physically interpretable. In process control, for example, (nearly) linear models are favored than nonlinear…
The aim of this paper is to study the cohomology of Hom-Leibniz superalgebras. We construct the $q$-deformed Heisenberg-Virasoro superalgebra of Hom-type and provide as application the computations of the derivations and second cohomology…
Akama et al. [1] introduced a hierarchical classification of first-order formulas for a hierarchical prenex normal form theorem in semi-classical arithmetic. In this paper, we give a justification for the hierarchical classification in a…
A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…
Given a graph $G$, a hypergraph $\mathcal{H}$ is a Berge copy of $F$ if $V(G)\subset V(\mathcal{H})$ and there is a bijection $f:E(G)\rightarrow E(\mathcal{H})$ such that for any edge $e$ of $G$ we have $e\subset f(e)$. We study Ramsey…
We reduce the calculation of the simplest Hodge integrals to some sums over decorated trees. Since Hodge integrals are already calculated, this gives a proof of a rather interesting combinatorial theorem and a new representation of…
In this paper we investigate a class of $2$-Hessian equations and establish a minimum principle for a $P$-function in the sense of L.E. Payne (see R. Sperb \cite{Sp81}). The analysis is based on a sharp matrix inequality providing an…
The core challenge in a Hoare- or Dijkstra-style proof system for graph programs is in defining a weakest liberal precondition construction with respect to a rule and a postcondition. Previous work addressing this has focused on assertion…
We use a second-order analogy $\mathsf{PRA}^2$ of $\mathsf{PRA}$ to investigate the proof-theoretic strength of theorems in countable algebra, analysis, and infinite combinatorics. We compare our results with similar results in the…
We develop the basic theory of projective modules and splitting in the more general setting of systems. Systems provide a common language for most tropical algebraic approaches including supertropical algebra, hyperrings (specifically…
We define a bi-directional embedding between hypersequent calculi and a subclass of systems of rules (2-systems). In addition to showing that the two proof frameworks have the same expressive power, the embedding allows for the recovery of…