Related papers: Valuations in G\"{o}del Logic, and the Euler Chara…
Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators "t:",…
It is shown that quantum logic is a logic in the very same way in which classical logic is a logic. Soundness and completeness of both quantum and classical logics have been proved for novel lattice models that are not orthomodular and…
The Euler characteristic is an invariant of a topological space that in a precise sense captures its canonical notion of size, akin to the cardinality of a set. The Euler characteristic is closely related to the homology of a space, as it…
We give some characterizations for the critical values at infinity of a rational function in two complex variables in terms of the Euler characteristic, the Malgrange condition and the M-tameness
We prove the $L^2$-Euler characteristic has the invariance under the barycentric subdivision only for finite acyclic categories. And we extend the definition of $L^2$-Euler characteristic and prove the extended $L^2$-Euler characteristic…
We study many-valued coalgebraic logics with semi-primal algebras of truth-degrees. We provide a systematic way to lift endofunctors defined on the variety of Boolean algebras to endofunctors on the variety generated by a semi-primal…
G{\"o}del's completeness theorem for classical first-order logic is one of the most basic theorems of logic. Central to any foundational course in logic, it connects the notion of valid formula to the notion of provable formula.We survey a…
Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is…
In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of this paper is the development of a new \emph{binary} sequent calculi (each sequent is a pair of formulae) for…
We define an axiomatic class of L-functions extending the Selberg class. We show in particular that one can recast the traditional conditions of an Euler product, analytic continuation and functional equation in terms of distributional…
We use some basic properties of binomial and Stirling numbers to prove that the Euler characteristic is, essentially, the unique numerical topological invariant for compact polyhedra which can be expressed as a linear combination of the…
We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning). Every neuron has a meaning as a component of a formula in a weighted real-valued logic, yielding a…
The literature dealing with G\"{o}del's legacy is largely preoccupied with challenging his philosophical views, regarding them as outdated. We believe that such an approach prevents us from seeing G\"{o}del's views in the right light and…
The higher characteristics w_m(G) for a finite abstract simplicial complex G are topological invariants that satisfy k-point Green function identities and can be computed in terms of Euler characteristic in the case of closed manifolds,…
The Jankov (characteristic) formulas were introduced by V.Jankov fifty tears ago in 1963. Nowadays the Jankov (or frame) formulas are used in virtually every branch of propositional logic: intermediate, modal, fuzzy, relevant, many-valued,…
We give a variational formulation for $-\log\mathbb{E}_\nu\left[e^{-f}|\mathcal{F}_t\right]$ for a large class of measures $\nu$. We give a refined entropic characterization of the invertibility of some perturbations of the identity. We…
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computation of probabilities and for reasoning about probabilities,…
E158 in the Enestrom index. Translation of the Latin original "Observationes analyticae variae de combinationibus" (1741). This paper introduces the problem of partitions, or partitio numerorum (the partition of integers). In the first part…
We develop a general method for computing the homological Euler characteristic of finite index subgroups G of GL_m(O_K) where O_K is the ring of integers in a number field K. With this method we find, that for large, explicitly computed…
We introduce and study finite analogues of Euler's constant in the same setting as finite multiple zeta values. We define a couple of candidate values from the perspectives of a ``regularized value of $\zeta(1)$'' and of Mascheroni's and…