13,408 research outputs found
About Nonstandard Neutrosophic Logic (Answers to Imamura 'Note on the Definition of Neutrosophic Logic')
In order to more accurately situate and fit the neutrosophic logic into the
framework of nonstandard analysis, we present the neutrosophic inequalities,
neutrosophic equality, neutrosophic infimum and supremum, neutrosophic standard
intervals, including the cases when the neutrosophic logic standard and
nonstandard components T, I, F get values outside of the classical real unit
interval [0, 1], and a brief evolution of neutrosophic operators. The paper
intends to answer Imamura criticism that we found benefic in better
understanding the nonstandard neutrosophic logic, although the nonstandard
neutrosophic logic was never used in practical applications.Comment: 16 page
Satisfaction classes in nonstandard models of first-order arithmetic
A satisfaction class is a set of nonstandard sentences respecting Tarski's
truth definition. We are mainly interested in full satisfaction classes, i.e.,
satisfaction classes which decides all nonstandard sentences. Kotlarski,
Krajewski and Lachlan proved in 1981 that a countable model of PA admits a
satisfaction class if and only if it is recursively saturated. A proof of this
fact is presented in detail in such a way that it is adaptable to a language
with function symbols. The idea that a satisfaction class can only see finitely
deep in a formula is extended to terms. The definition gives rise to new
notions of valuations of nonstandard terms; these are investigated. The notion
of a free satisfaction class is introduced, it is a satisfaction class free of
existential assumptions on nonstandard terms.
It is well known that pathologies arise in some satisfaction classes. Ideas
of how to remove those are presented in the last chapter. This is done mainly
by adding inference rules to M-logic. The consistency of many of these
extensions is left as an open question.Comment: Thesis for the degree of licentiate of philosophy, 74 pages, 4
figure
Generalized Veltman models with a root
Provability logic is a nonstandard modal logic. Interpretability logic is an extension of provability logic. Generalized Veltman models are Kripke like semantics for interpretability logic. We consider generalized
Veltman models with a root, i.e. r-validity, r-satisfiability and
a consequence relation. We modify Fine\u27s and Rautenberg\u27s proof
and prove non-compactness of interpretability logic
- …