相关论文: A Gr\"atzer-Schmidt theorem for the Lindenbaum-Tar…
We derive the discrete version of the classical Helmholtz condition. Precisely, we state a theorem characterizing second order finite differences equations admitting a Lagrangian formulation. Moreover, in the affirmative case, we provide…
Proof systems for the Relativized Propositional Calculus are defined and compared.
Suszko's Sentential Calculus with Identity SCI results from classical propositional calculus CPC by adding a new connective $\equiv$ and axioms for identity $\varphi\equiv\psi$ (which we interpret here as `propositional identity'). We…
In this expository style of writing I will give an introduction of Gr\"{o}bner bases and compute it for some algebras and then show how to use it to compute Hilbert series for algebras from chains.
We present a sequent calculus for the Grzegorczyk modal logic Grz allowing cyclic and other non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs.…
One of the benefit properties implied by the extensionality axiom of Hilbert's epsilon calculus is that the calculus becomes complete with respect to the choice structures as semantics. Another implication of the axiom, discussed in the…
I formalize important theorems about classical propositional logic in the proof assistant Coq. The main theorems I prove are (1) the soundness and completeness of natural deduction calculus, (2) the equivalence between natural deduction…
Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…
In this work we present a novel proof of the Saalschutz formula by using the theory of discrete fractional calculus. The proofs of some results within this theory, namely, the fractional power rule and the fractional Leibniz rule are…
Following G. Mints(Kluwer 2000 and draft 2013), we present terminating and bicomplete proof searches in multi-succedent sequent calculi for intuitionistic propositional logic, fragments of intuitionistic predicate logic and full…
We prove several representation theorems for infinitary predicate modal logic
It is shown that propositional intuitionistic logic is the maximal (with respect to expressive power) abstract logic satisfying a certain topological property reminiscent of compactness, the Tarski union property and preservation under…
For a given intuitionistic propositional formula A and a propositional variable x occurring in it, define the infinite sequence of formulae { A \_i | i$\ge$1} by letting A\_1 be A and A\_{i+1} be A(A\_i/x). Ruitenburg's Theorem [8] says…
We formulate a conjecture classifying algebraic solutions to (possibly non-linear) algebraic differential equations, in terms of the primes appearing in the denominators of the coefficients of their Taylor expansion at a non-singular point.…
We include here some material that did not make its way into the published version (Bull. Symb. Log 18-2, June 2012, pp. 161-229, arXiv:1007.2376), in particular a proof of Theorem K to the effect that there is an initial segment of the…
An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…
We compute the K-theory of the Cuntz-Krieger C^*-algebras associated to infinite matrices.
A version of Auslander theorem is proven for the following classes of noncommutative algebras: (a) noetherian PI local (or connected graded) algebras of finite injective dimension, (b) universal enveloping algebras of finite dimensional Lie…
We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…
Almost from the inception of Hilbert's program, foundational and structural efforts in proof theory have been directed towards the goal of clarifying the computational content of modern mathematical methods. This essay surveys various…