Related papers: Finite Hilbert systems for Weak Kleene logics
Ultrafinitism postulates that we can only compute on relatively short objects, and numbers beyond certain value are not available. This approach would also forbid many forms of infinitary reasoning and allow to remove certain paradoxes…
We investigate the end extendibility of models of arithmetic with restricted elementarity. By utilizing the restricted ultrapower construction in the second-order context, for each $n\in\mathbb{N}$ and any countable model of…
The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding…
We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…
Strong typicality and the Markov lemma have been used in the proofs of several multiterminal source coding theorems. Since these two tools can be applied to finite alphabets only, the results proved by them are subject to the same…
We introduce the multigraded Hilbert scheme, which parametrizes all homogeneous ideals with fixed Hilbert function in a polynomial ring that is graded by any abelian group. Our construction is widely applicable, it provides explicit…
In this article we prove convergence of adaptive finite element methods for second order elliptic eigenvalue problems. We consider Lagrange finite elements of any degree and prove convergence for simple as well as multiple eigenvalues under…
Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose…
The use of Extended Logics to replace ordinary second order definability in Kleene's {\em Ramified Analytical Hierarchy} is investigated. This mirrors a similar investigation of Kennedy, Magidor and V\"a\"an\"anen \cite{KeMaVa2016} where…
We extend classical work by Janusz Czelakowski on the closure properties of the class of matrix models of entailment relations - nowadays more commonly called multiple-conclusion logics - to the setting of non-deterministic matrices…
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…
This paper deals with the finite-time stabilization of a class of nonlinear infinite-dimensional systems. First, we consider a bounded matched perturbation in its linear form. It is shown that by using a set-valued function, both the…
In this note, we present a systematic method to explicitly compute the determinants and inverses for some generalized Hilbert matrices associated with orthogonal systems with explicit representations. We expressed the determinant, the…
In [Hitzler and Wendt 2002, 2005], a new methodology has been proposed which allows to derive uniform characterizations of different declarative semantics for logic programs with negation. One result from this work is that the well-founded…
This study delves into equilibrium problems, focusing on the identification of finite solutions for feasible solution sequences. We introduce an innovative extension of the weak sharp minimum concept from convex programming to equilibrium…
We prove that the problem of determining whether a finite logical matrix determines an algebraizable logic is complete for EXPTIME. The same result holds for the classes of order algebraizable, weakly algebraizable, equivalential and…
We investigate the possibility of extending the non-functionally complete logic of a collection of Boolean connectives by the addition of further Boolean connectives that make the resulting set of connectives functionally complete. More…
Bernays introduced a method for proving underivability results in propositional calculi by truth tables. In general, this motivates an investigations of how to find, given a propositional logic, a finite-valued logic which has as few…
We use the work of Milton, Seppecher, and Bouchitt\'{e} on variational principles for waves in lossy media to formulate a finite element method for solving the complex Helmholtz equation that is based entirely on minimization. In…
We know extensions of first order logic by quantifiers of the kind "there are uncountable many ...", "most ..." with new axioms and appropriate semantics. Related are operations such as "set of x, such that ...", Hilbert's…