On interplay of quantifiers in Gödel-Dummett fuzzy logics

Axiomatization of Gödel-Dummett predicate logics S2G, S3G, and PG, where PG is the weakest logic in which all prenex operations are sound, and the relationships of these logics to logics known from the literature are discussed. Examples of non-prenexable formulas are given for those logics where some prenex operation is not available. Inter-expressibility of quantifiers is explored for each of the considered logics.     

On Representing Concepts in Finite Models

We present a method of transferring Tarski's technique of classifying finite order concepts by means of truth‐definitions into finite mode theory. The other considered question is the problem of representability relations on words or natural numbers in finite models. We prove that relations representable in finite models are exactly those which are of degree ≤ o′. Finally, we consider theories of sufficiently large finite models. For a given theory T we define sl(T) as the set of all sentences true in almost all finite models for T. For theories of sufficiently large models our version of Tarski's technique becomes practically the same as the classica one. We investigate also degrees of undecidability for theories of sufficiently large finite models. We prove for some special theory ST that its degree is stronger than 0′ but still not more than Σ⁰₂.     

Degrees of difficulty of generalized r.e. separating classes

Important examples of classes of functions are the classes of sets (elements of ^ω 2) which separate a given pair of disjoint r.e. sets: . A wider class consists of the classes of functions f ∈ ^ω k which in a generalized sense separate a k-tuple of r.e. sets (not necessarily pairwise disjoint) for each k ∈ ω: . We study the structure of the Medvedev degrees of such classes and show that the set of degrees realized depends strongly on both k and the extent to which the r.e. sets intersect. Let denote the Medvedev degrees of those such that no m + 1 sets among A ₀,...,A _k-1 have a nonempty intersection. It is shown that each is an upper semi-lattice but not a lattice. The degree of the set of k-ary diagonally nonrecursive functions is the greatest element of . If 2 ≤ l < k, then 0 _M is the only degree in which is below a member of . Each is densely ordered and has the splitting property and the same holds for the lattice it generates. The elements of are exactly the joins of elements of for . Supported by National Science Foundation grants DMS 0554841, 0532644 and 0652732.     

The Axiom of Choice in Second-Order Predicate Logic

The present article deals with the power of the axiom of choice (AC) within the second-order predicate logic. We investigate the relationship between several variants of AC and some other statements, known as equivalent to AC within the set theory of Zermelo and Fraenkel with atoms, in Henkin models of the one-sorted second-order predicate logic with identity without operation variables. The construction of models follows the ideas of Fraenkel and Mostowski. It is e. g. shown that the well-ordering theorem for unary predicates is independent from AC for binary predicates and from the trichotomy law for unary predicates. Moreover, we show that the AC for binary predicates follows neither from the trichotomy law for unary predicates nor from Zorn's lemma for unary predicates nor from the formalization of the axiom of choice for disjoint families of sets for binary predicates, and that the trichotomy law for unary predicates does not follow from AC for binary predicates. Mathematics Subject Classification: 03B15, 03E25, 04A25.     

数理逻辑中的数值化方法

数理逻辑的本质是形式推理而不是数值计算,非此即彼式的严谨性是其特征,因而在一定意义下它是"两极化"的.比如,(1)一个逻辑理论或者是相容的,或者是不相容的,不存在"半相容的"理论.(2)"逻辑公式A是假设集T的推论"或者成立,或者不成立,说它近似成立是无意义的.(3)逻辑公式中有重言式和矛盾式,但没有0.8重言式.本文的目的在于为上述基本概念提供程度化的版本,并从而建立一种近似推理理论.     

Separation logic and logics with team semantics

Separation logic is a successful logical system for formal reasoning about programs that mutate their data structures. Team semantics, on the other side, is the basis of modern logics of dependence and independence. Separation logic and team semantics have been introduced with quite different motivations, and are investigated by research communities with rather different backgrounds and objectives. Nevertheless, there are obvious similarities between these formalisms. Both separation logic and logics with team semantics involve the manipulation of second-order objects, such as heaps and teams, by first-order syntax without reference to second-order variables. Moreover, these semantical objects are closely related; it is for instance obvious that a heap can be seen as a team, and the separating conjunction of separation logic is (essentially) the same as the team-semantical disjunction. Based on such similarities, the possible connections between separation logic and team semantics have been raised as a question at several occasions, and lead to informal discussions between these research communities. The objective of this paper is to make this connection precise, and to study its potential but also its obstacles and limitations.     

Quantum logics with the Riesz Interpolation Property

We study the quantum logics which satisfy the Riesz Interpolation Property. We call them the RIP logics. We observe that the class of RIP logics is considerable large—it contains all lattice quantum logics and, also, many (infinite) non‐lattice ones. We then find out that each RIP logic can be enlarged to an RIP logic with a preassigned centre. We continue, showing that the “nearly” Boolean RIP logics must be Boolean algebras. In a somewhat surprising contrast to this, we finally show that the attempt for the σ‐complete formulation of this result fails: We show by constructing an example that there is a non‐Boolean nearly Boolean σ‐RIP logic. As a result, there are interesting σ‐RIP logics which are intrinsically close to Boolean σ‐algebras. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Spectra of degrees of some structures

We argue for the existence of structures with the spectrum {x : x ≰ a} of degrees, where a is an arbitrary low degree. Also it is stated that there exist structures with the spectrum of degrees, {x : x ≰ a} ⋃ {x : x ≰ b}, for any low degrees a and b. Supported by RFBR grant No. 05-01-00605. __________ Translated from Algebra i Logika, Vol. 46, No. 6, pp. 729–744, November–December, 2007.     

On the Presburger fragment of logics with multiteam semantics

In team semantics, which is the basis of modern logics of dependence and independence, formulae are evaluated on sets of assignments, called teams. Multiteam semantics instead takes mulitplicities of data into account and is based on multisets of assignments, called multiteams. Logics with multiteam semantics can be embedded into a two-sorted variant of existential second-order logics, with arithmetic operations on multiplicities. Here we study the Presburger fragment of such logics, permitting only addition, but not multiplication on multiplicities. It can be shown that this fragment corresponds to inclusion-exclusion logic in multiteam semantics, but, in contrast to the situation in team semantics, that it is strictly contained in independence logic. We give different characterisations of this fragment by various atomic dependency notions.     

Separability of normalizable superintuitionistic propositional logics

The problem of separability of superintuitionistic propositional logics that are extensions of the intuitionistic propositional logic is studied. A criterion of separability of normal superintuitionistic propositional logics, as well as results concerning the completeness of their subcalculi is obtained. This criterion makes it possible to determine whether a normalizable superintuitionistic propositional logic is separable. By means of these results, the mistakes discovered by the author in the proofs of certain statements by McKay and Hosoi are corrected.Translated fromMatematicheskie Zametki, Vol. 64, No. 4, pp. 606–615, October, 1998.This research was supported by the Russian Foundation for Basic Research under grant No. 94-01-00944.     

$I$-模糊拓扑空间中的模糊紧度

本文借助不等式给出了$I$-模糊拓扑空间中模糊紧度的概念, 并研究了相关的性质.     

Degrees of presentability of structures. II

We show that the property of being locally constructivizable is inherited under Muchnik reducibility, which is weakest among the effective reducibilities considered over countable structures. It is stated that local constructivizability of level higher than 1 is inherited under Σ-reducibility but is not inherited under Medvedev reducibility. An example of a structure and a relation P ⊆ M is constructed for which but ≢_∑ . Also, we point out a class of structures which are effectively defined by a family of their local theories. Supported by RFBR (grant Nos. 05-0100481 and 06-0104002), by the Council for Grants (under RF President) for State Support of Young Candidates of Science and Their Supervisors (project MK-1239.2005.1), and by INTAS (project YSF 04-83-3310). __________ Translated from Algebra i Logika, Vol. 47, No. 1, pp. 108–126, January–February, 2008.     

Sufficient triangular norms in many-valued logics with standard negation

In many-valued logics with the unit interval as the set of truth values, from the standard negation and the product (or, more generally, from any strict Frank t-norm) all measurable logical functions can be derived, provided that also operations with countable arity are allowed. The question remained open whether there are other t-norms with this property or whether all strict t-norms possess this property. We give a full solution to this problem (in the case of strict t-norms), together with convenient sufficient conditions. We list several families of strict t-norms having this property and provide also counterexamples (the Hamacher product is one of them). Finally, we discuss the consequences of these results for the characterization of tribes based on strict t-norms.     

Degrees of presentability of structures. I

Presentations of structures in admissible sets, as well as different relations of effective reducibility between the structures, are treated. Semilattices of degrees of Σ-definability are the main object of investigation. It is shown that the semilattice of degrees of Σ-definability of countable structures agrees well with semilattices of T-and e-degrees of subsets of natural numbers. Also an attempt is made to study properties of the structures that are inherited under various effective reducibilities and explore how degrees of presentability depend on choices of different admissible sets as domains for presentations. Supported by RFBR grant Nos. 05-0100481 and 06-0104002, by the Council for Grants (under RF President) for State Support of Young Candidates of Science and Their Supervisors via project MK-1239.2005.1, and via INTAS project YSF 04-83-3310. __________ Translated from Algebra i Logika, Vol. 46, No. 6, pp. 763–788, November–December, 2007.