Related papers: Negation-Free Definitions of Paraconsistency

This paper analyses the declarative readings of logic programming. Logic programming - and negation as failure - has no unique declarative reading. One common view is that logic programming is a logic for default reasoning, a sub-formalism…

This article answers two questions (posed in the literature), each concerning the guaranteed existence of proofs free of double negation. A proof is free of double negation if none of its deduced steps contains a term of the form n(n(t))…

For 75 years the theory of nuclear fission has been based on the existence of a collective coordinate associated with the nuclear shape, an assumption required by the Bohr-Wheeler formula as well as by the R-matrix theory of fission. We…

It is usually assumed that any consistent interaction either deforms or retains the gauge symmetries of the corresponding free theory. We propose a simple model where an obvious irreducible gauge symmetry does not survive an interaction,…

A nonlinear parabolic differential equation is presented which has at least one equilibrium. This equilibrium is shown to have a negative definite linearization, but a spectrum which includes zero. An elementary construction shows that the…

Negation operation is important in intelligent information processing. Different with existing arithmetic negation, an exponential negation is presented in this paper. The new negation can be seen as a kind of geometry negation. Some basic…

Nonrenormalizable scalar fields, such as \varphi^4_n, n\ge5, require infinitely many distinct counter terms when perturbed about the free theory, and lead to free theories when defined as the continuum limit of a lattice regularized theory…

The concept of decoherence is defined, and discussed in a historical context. This is illustrated by some of its essential consequences which may be relevant for the interpretation of quantum theory. Various aspects of the formalism are…

In the literature, the question about how to axiomatize the transitive logic of false belief is thought of as hard and left as an open problem. In this paper, among other contributions, we deal with this problem. In more details, although…

Causality has been often confused with the notion of determinism. It is mandatory to separate the two notions in view of the debate about quantum foundations. Quantum theory provides an example of causal not-deterministic theory. Here we…

We apply a paraconsistent logic to reason about fractions.

Modelling complex information systems often entails the need for dealing with scenarios of inconsistency in which several requirements either reinforce or contradict each other. In this kind of scenarios, arising e.g. in knowledge…

The syntactic structure of a sentence can be modeled as a tree where vertices are words and edges indicate syntactic dependencies between words. It is well-known that those edges normally do not cross when drawn over the sentence. Here a…

An axiomatic theory of operator connections and operator means was investigated by Kubo and Ando in 1980. A connection is a binary operation for positive operators satisfying the monotonicity, the transformer inequality and the…

It is shown that if antiparticles are realized in quantum field theory by negative frequency states, which nevertheless have positive energy density, the resulting theory provides a qualitative explanation for the experiments on the neutral…

Nuclear fission represents the ultimate test for microscopic theories of nuclear structure and reactions. Fission is a large-amplitude, time-dependent phenomenon taking place in a self-bound, strongly-interacting many-body system. It…

A paradefinite logic is a logic that can serve as the underlying logic for theories that are inconsistent or incomplete. A well-known paradefinite logic is Belnap-Dunn logic. Various expansions of Belnap-Dunn logic have been studied in the…

The full power of human language-based communication cannot be realized without negation. All human languages have some form of negation. Despite this, negation remains a challenging phenomenon for current natural language understanding…

In the absence of empirical confirmation, scientists may judge a theory's chances of being viable based on a wide range of arguments. The paper argues that such arguments can differ substantially with regard to their structural similarly to…

In this paper we study the uses and the semantics of non-monotonic negation in probabilistic deductive data bases. Based on the stable semantics for classical logic programming, we introduce the notion of stable formula, functions. We show…