Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userParaconsistent First-Order Logic with infinite hierarchy levels of contradiction $LP^#_{omega}$. Axiomatical system $HST^#_{omega}$, as paraconsistent generalization of Hrbacek set theory HST
244
0
0.0
(
0
)
Authors
Jaykov Foukzon
Ask ChatGPT about the research
No Arabic abstract
In this paper paraconsistent first-order logic LP^{#}_{omega} with infinite hierarchy levels of contradiction is proposed. Corresponding paraconsistent set theory KSth^{#}_{omega} is discussed.Axiomatical system HST^{#}_{omega} as paraconsistent generalization of Hrbacek set theory HST is considered.
rate research
Read More
In this paper paraconsistent second order arithmetic Z#2 with unrestricted comprehension scheme is proposed. We outline the development of certain portions of paraconsistent mathematics within paraconsistent second order arithmetic Z#2.In particular we defined infinite hierarchy Berrys and Richards inconsistent numbers as elements of the paraconsistent field R^#.
In this paper the 3-valued paraconsistent first-order logic QCiore is studied from the point of view of Model Theory. The semantics for QCiore is given by partial structures, which are first-order structures in which each n-ary predicate R is interpreted as a triple of paiwise disjoint sets of n-uples representing, respectively, the set of tuples which actually belong to R, the set of tuples which actually do not belong to R, and the set of tuples whose status is dubious or contradictory. Partial structures were proposed in 1986 by I. Mikenberg, N. da Costa and R. Chuaqui for the theory of quasi-truth (or pragmatic truth). In 2014, partial structures were studied by M. Coniglio and L. Silvestrini for a 3-valued paraconsistent first-order logic called LPT1, whose 3-valued propositional fragment is equivalent to da Costa-DOtavianos logic J3. This approach is adapted in this paper to QCiore, and some important results of classical Model Theory such as Robinsons joint consistency theorem, amalgamation and interpolation are obtained. Although we focus on QCiore, this framework can be adapted to other 3-valued first-order logics.
This paper is concerned with the first-order paraconsistent logic LPQ$^{supset,mathsf{F}}$. A sequent-style natural deduction proof system for this logic is presented and, for this proof system, both a model-theoretic justification and a logical justification by means of an embedding into first-order classical logic is given. For no logic that is essentially the same as LPQ$^{supset,mathsf{F}}$, a natural deduction proof system is currently available in the literature. The given embedding provides both a classical-logic explanation of this logic and a logical justification of its proof system. The major properties of LPQ$^{supset,mathsf{F}}$ are also treated.
In 1942 Haskell B.Curry presented what is now called Curry paradox which can be found in a logic independently of its stand on negation.In recent years there has been a revitalised interest in non-classical solutions to the semantic paradoxes. In this article the non-classical resolution of Currys Paradox and Shaw-Kwei paradox without rejection any contraction postulate is proposed.
We present a position in infinite chess exhibiting an ordinal game value of $omega^4$, thereby improving on the previously largest-known values of $omega^3$ and $omega^3cdot 4$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
