A semantic study of the first-order predicate logic with uncertainty involved

In this paper, we provide a semantic study of the first-order predicate logic for situations involving uncertainty. We introduce the concepts of uncertain predicate proposition, uncertain predicate formula, uncertain interpretation and degree of truth in the framework of uncertainty theory. Compared with classical predicate formula taking true value in \(\{0,1\}\) , the degree of truth of uncertain predicate formula may take any value in the unit interval \([0,1]\) . We also show that the uncertain first-order predicate logic is consistent with the classical first-order predicate logic on some laws of the degree of truth.     

一阶模糊谓词逻辑公式的解释模型真度理论及其应用

基于一阶模糊谓词逻辑公式的有限和可数解释真度的理论,引入了一阶模糊谓词逻辑公式的解释模型及解释模型真度的概念,并讨论了它们的一系列性质及其在近似推理中的应用.     

Dung’s Argumentation is Essentially Equivalent to Classical Propositional Logic with the Peirce–Quine Dagger

In this paper we show that some versions of Dung’s abstract argumentation frames are equivalent to classical propositional logic. In fact, Dung’s attack relation is none other than the generalised Peirce–Quine dagger connective of classical logic which can generate the other connectives ?, ù, ú, ?{\neg, \wedge, \vee, \to} of classical logic. After establishing the above correspondence we offer variations of the Dung argumentation frames in parallel to variations of classical logic, such as resource logics, predicate logic, etc., etc., and create resource argumentation frames, predicate argumentation frames, etc., etc. We also offer the notion of logic proof as a geometrical walk along the nodes of a Dung network and thus we are able to offer a geometrical abstraction of the notion of inference based argumentation. Thus our paper is also a contribution to the question:     

A short proof of Glivenko theorems for intermediate predicate logics

We give a simple proof-theoretic argument showing that Glivenko’s theorem for propositional logic and its version for predicate logic follow as an easy consequence of the deduction theorem, which also proves some Glivenko type theorems relating intermediate predicate logics between intuitionistic and classical logic. We consider two schemata, the double negation shift (DNS) and the one consisting of instances of the principle of excluded middle for sentences (REM). We prove that both schemata combined derive classical logic, while each one of them provides a strictly weaker intermediate logic, and neither of them is derivable from the other. We show that over every intermediate logic there exists a maximal intermediate logic for which Glivenko’s theorem holds. We deduce as well a characterization of DNS, as the weakest (with respect to derivability) scheme that added to REM derives classical logic.     

On consistency of information models

During the last years a number of approaches to information modeling have been presented. An information model is then assumed to be expressed in some formalism based on a set of basic concepts and construction rules. Some approaches also include inference rules, but few include consistency criteria for information models. Two different approaches to information modeling have been analyzed within the framework of first-order predicate logic. In particular, their consistency criteria are compared with that of predicate logic. The approaches are completely expressible in predicate logic and the consistency criteria have a logical counterpart only when a set of implicit assumptions is stated explicitly.This work is supported by the National Swedish Board for Technical Development.     

一阶模糊谓词逻辑公式的区间解释真度理论

通过引进一阶模糊语言变元集赋值的新概念,给出了一阶模糊谓词逻辑(或一阶模糊语言)公式的区间解释真度的定义,并讨论了它们的一系列性质。     

Bilinear spaces over a fixed field are simple unstable

We study the model theory of vector spaces with a bilinear form over a fixed field. For finite fields this can be, and has been, done in the classical framework of full first-order logic. For infinite fields we need different logical frameworks. First we take a category-theoretic approach, which requires very little set-up. We show that linear independence forms a simple unstable independence relation. With some more work we then show that we can also work in the framework of positive logic, which is much more powerful than the category-theoretic approach and much closer to the classical framework of full first-order logic. We fully characterise the existentially closed models of the arising positive theory. Using the independence relation from before we conclude that the theory is simple unstable, in the sense that dividing has local character but there are many distinct types. We also provide positive version of what is commonly known as the Ryll-Nardzewski theorem for ω-categorical theories in full first-order logic, from which we conclude that bilinear spaces over a countable field are ω-categorical.     

Isotopy invariants for smooth tori in 4-manifolds

In this paper we define invariants under smooth isotopy for certain two-dimensional knots using some refined Cerf theory. One of the invariants is the knot type of some classical knot generalizing the string number of closed braids. The other invariant is a generalization of the unique invariant of degree 1 for classical knots in 3-manifolds. Possibly, these invariants can be used to distinguish smooth embeddings of tori in some 4-manifolds but which are equivalent as topological embeddings.     

Axiomatising the Prior Future in Predicate Logic

Prior investigated a tense logic with an operator for ‘historical necessity’, where a proposition is necessary at a time iff it is true at that time in all worlds ‘accessible’ from that time. Axiomatisations of this logic all seem to require non-standard axioms or rules. The present paper presents an axiomatisation of a first-order version of Prior’s logic by using a predicate which enables any time to be picked out by an individual in the domain of interpretation.     

Interpolation in superintuitionistic predicate logics with equality

It is shown that the Craig interpolation property and the Beth property are preserved under passage from a superintuitionistic predicate logic to its extension via standard axioms for equality, and under adding formulas of pure equality as new axioms. We find an infinite independent set of formulas which, though not equivalent to formulas of pure equality, may likewise be added as new axiom schemes without loss of the interpolation, or Beth, property. The formulas are used to construct a continuum of logics with equality, which are intermediate between the intuitionistic and classical ones, having the interpolation property. Moreover, an equality-free fragment of the logics constructed is an intuitionistic predicate logic, and formulas of pure equality satisfy all axioms of the classical predicate logic. Supported by RFFR grant No. 96-01-01552. Translated fromAlgebra i Logika, Vol. 36, No. 5, pp. 543–561, September–October, 1997.     

Algebraic semantics for superintuitionistic predicate logics

We construct a unified algebraic semantics for superintuitionistic predicate logics. Assigned to each predicate logic is some deductive system of a propositional language which is kept fixed throughout all predicate superintuitionistic ones. Given that system, we build up a variety of algebras w.r.t. which a given logic is proved to be strongly complete. Supported by the Russian Arts Foundation (RAF), grant No. 97-03-04089a. Translated fromAlgebra i Logika, Vol. 38, No. 1, pp. 68–95, January–February, 1999.     

模糊推理三I算法的逻辑基础

在模糊推理理论中，近期问世的三I推理方法以逻辑蕴涵运算取代传统的合成运算，从根本上改进了传统的合成推理规则(即CRI方法)。本文基于模糊命题逻辑的形式演绎系统L^*和模糊谓词逻辑的一阶系统K^*，构建了一个完备的多型变元一阶系统Kms^*，并且将三I算法完全纳入了模糊逻辑的框架之中，从而为模糊推理奠定了严格的逻辑基础。     

基于L~*-格值逻辑上的BCK-代数中直觉不分明化理想

在L~*-格值逻辑的语义框架下,以L~*-格值上的Lukasiewicz蕴涵算子为工具定义了L~*-格值逻辑上的直觉不分明化BCK-代数的概念,将用集论所刻画的BCK-代数中理想、正定蕴涵理想和蕴涵理想等概念在L~*-格值谓词演算下给予了新的刻画,讨论了它们的性质及其关系,研究了这些理想与其同态象、同态原象之间关系,获得了同类理想之积仍为该类理想.     

Glivenko theorems and negative translations in substructural predicate logics

Along the same line as that in Ono (Ann Pure Appl Logic 161:246–250, 2009), a proof-theoretic approach to Glivenko theorems is developed here for substructural predicate logics relative not only to classical predicate logic but also to arbitrary involutive substructural predicate logics over intuitionistic linear predicate logic without exponentials QFL _e . It is shown that there exists the weakest logic over QFL _e among substructural predicate logics for which the Glivenko theorem holds. Negative translations of substructural predicate logics are studied by using the same approach. First, a negative translation, called extended Kuroda translation is introduced. Then a translation result of an arbitrary involutive substructural predicate logics over QFL _e is shown, and the existence of the weakest logic is proved among such logics for which the extended Kuroda translation works. They are obtained by a slight modification of the proof of the Glivenko theorem. Relations of our extended Kuroda translation with other standard negative translations will be discussed. Lastly, algebraic aspects of these results will be mentioned briefly. In this way, a clear and comprehensive understanding of Glivenko theorems and negative translations will be obtained from a substructural viewpoint.     

On arithmetic in the Cantor- Łukasiewicz fuzzy set theory

Axiomatic set theory with full comprehension is known to be consistent in Łukasiewicz fuzzy predicate logic. But we cannot assume the existence of natural numbers satisfying a simple schema of induction; this extension is shown to be inconsistent.Long before them, Klaua and Gottwald studied various forms of iterated fuzzy power set constructions inside classical set theory, see the references.     

Monadic <Emphasis Type="Italic">GMV</Emphasis>-algebras

Monadic MV-algebras are an algebraic model of the predicate calculus of the Łukasiewicz infinite valued logic in which only a single individual variable occurs. GMV-algebras are a non-commutative generalization of MV-algebras and are an algebraic counterpart of the non-commutative Łukasiewicz infinite valued logic. We introduce monadic GMV-algebras and describe their connections to certain couples of GMV-algebras and to left adjoint mappings of canonical embeddings of GMV-algebras. Furthermore, functional MGMV-algebras are studied and polyadic GMV-algebras are introduced and discussed. The first author was supported by the Council of Czech Government, MSM 6198959214.     

Computer-Assisted Analysis of the Anderson–Hájek Ontological Controversy

A universal reasoning approach based on shallow semantical embeddings of higher-order modal logics into classical higher-order logic is exemplarily employed to analyze several modern variants of the ontological argument on the computer. Several novel findings are reported which contribute to the clarification of a long-standing dispute between Anderson and Hájek. The technology employed in this work, which to some degree realizes Leibniz’s dream of a characteristica universalis and a calculus ratiocinator for solving philosophical controversies, is ready to be fruitfully adopted in larger scale by philosophers.     

Completeness of two systems of illative combinatory logic for first-order propositional and predicate calculus

Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers 4 systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators, or in a more direct way, in which derivations are not translated. Both translations are closely related in a canonical way. In a preceding paper, Barendregt, Bunder and Dekkers, 1993, we proved completeness of the two direct translations. In the present paper we prove completeness of the two indirect translations by showing that the corresponding illative systems are conservative over the two systems for the direct translations. In another version, DBB (1997), we shall give a more direct completeness proof. These papers fulfill the program of Church and Curry to base logic on a consistent system of -terms or combinators. Hitherto this program had failed because systems of ICL were either too weak (to provide a sound interpretation) or too strong (sometimes even inconsistent). Received: February 15, 1996     

Abelian-by-central Galois groups of fields II: Definability of inertia/decomposition groups

This paper explores some first-order properties of commuting-liftable pairs in pro-? abelian-by-central Galois groups of fields. The main focus of the paper is to prove that minimized inertia and decomposition groups of many valuations are first-order definable using a predicate for the collection of commuting-liftable pairs. For higher-dimensional function fields over algebraically closed fields, we show that the minimized inertia and decomposition groups of quasi-divisorial valuations are uniformly first-order definable in this language.     

The fluted fragment with transitive relations

The fluted fragment is a fragment of first-order logic (without equality) in which, roughly speaking, the order of quantification of variables coincides with the order in which those variables appear as arguments of predicates. It is known that this fragment has the finite model property. We consider extensions of the fluted fragment with various numbers of transitive relations, as well as the equality predicate. In the presence of one transitive relation (together with equality), the finite model property is lost; nevertheless, we show that the satisfiability and finite satisfiability problems for this extension remain decidable. We also show that the corresponding problems in the presence of two transitive relations (with equality) or three transitive relations (without equality) are undecidable, even for the two-variable sub-fragment.