predicate symbol
Recently Published Documents


TOTAL DOCUMENTS

29
(FIVE YEARS 0)

H-INDEX

7
(FIVE YEARS 0)

2019 ◽  
Vol 84 (1) ◽  
pp. 343-358 ◽  
Author(s):  
FEDOR PAKHOMOV ◽  
ALBERT VISSER

AbstractIn this paper, we study finitely axiomatizable conservative extensions of a theory U in the case where U is recursively enumerable and not finitely axiomatizable. Stanisław Krajewski posed the question whether there are minimal conservative extensions of this sort. We answer this question negatively.Consider a finite expansion of the signature of U that contains at least one predicate symbol of arity ≥ 2. We show that, for any finite extension α of U in the expanded language that is conservative over U, there is a conservative extension β of U in the expanded language, such that $\alpha \vdash \beta$ and $\beta \not \vdash \alpha$. The result is preserved when we consider either extensions or model-conservative extensions of U instead of conservative extensions. Moreover, the result is preserved when we replace $\dashv$ as ordering on the finitely axiomatized extensions in the expanded language by a relevant kind of interpretability, to wit interpretability that identically translates the symbols of the U-language.We show that the result fails when we consider an expansion with only unary predicate symbols for conservative extensions of U ordered by interpretability that preserves the symbols of U.



Author(s):  
Zeno Swijtink

Beth’s theorem is a central result about definability of non-logical symbols in classical first-order theories. It states that a symbol P is implicitly defined by a theory T if and only if an explicit definition of P in terms of some other expressions of the theory T can be deduced from the theory T. Intuitively, the symbol P is implicitly defined by T if, given the extension of these other symbols, T fixes the extension of the symbol P uniquely. In a precise statement of Beth’s theorem this will be replaced by a condition on the models of T. An explicit definition of a predicate symbol states necessary and sufficient conditions: for example, if P is a one-place predicate symbol, an explicit definition is a sentence of the form (x) (Px ≡φ(x)), where φ(x) is a formula with free variable x in which P does not occur. Thus, Beth’s theorem says something about the expressive power of first-order logic: there is a balance between the syntax (the deducibility of an explicit definition) and the semantics (across models of T the extension of P is uniquely determined by the extension of other symbols). Beth’s definability theorem follows immediately from Craig’s interpolation theorem. For first-order logic with identity, Craig’s theorem says that if φ is deducible from ψ, there is an interpolant θ, a sentence whose non-logical symbols are common to φ and ψ, such that θ is deducible from ψ, while φ is deducible from θ. Craig’s theorem and Beth’s theorem also hold for a number of non-classical logics, such as intuitionistic first-order logic and classical second-order logic, but fail for other logics, such as logics with expressions of infinite length.



2010 ◽  
Vol 75 (3) ◽  
pp. 785-801
Author(s):  
Luis Miguel ◽  
Villegas Silva

AbstractLet ℒ be a first-order language of cardinality κ++ with a distinguished unary predicate symbol U. In this paper we prove, working on L, the two cardinal transfer theorem (κ+,κ) ⇒ (κ++, κ+) for this language. This problem was posed by Chang and Keisler more than twenty years ago.



2009 ◽  
Vol 74 (4) ◽  
pp. 1121-1142 ◽  
Author(s):  
H. Jerome Keisler ◽  
Wafik Boulos Lotfallah

AbstractWe obtain an almost everywhere quantifier elimination for (the noncritical fragment of) the logic with probability quantifiers, introduced by the first author in [10]. This logic has quantifiers like ∃≥3/4y which says that “for at least 3/4 of all y”. These results improve upon the 0-1 law for a fragment of this logic obtained by Knyazev [11]. Our improvements are:1. We deal with the quantifier ∃≥ry, where y is a tuple of variables.2. We remove the closedness restriction, which requires that the variables in y occur in all atomic subformulas of the quantifier scope.3. Instead of the unbiased measure where each model with universe n has the same probability, we work with any measure generated by independent atomic probabilities PR for each predicate symbol R.4. We extend the results to parametric classes of finite models (for example, the classes of bipartite graphs, undirected graphs, and oriented graphs).5. We extend the results to a natural (noncritical) fragment of the infinitary logic with probability quantifiers.6. We allow each PR, as well as each r in the probability quantifier (∃≥ry), to depend on the size of the universe.



2003 ◽  
Vol 68 (1) ◽  
pp. 319-351 ◽  
Author(s):  
Michael Benedikt ◽  
H. Jerome Keisler

AbstractWe settle a number of questions concerning definability in first order logic with an extra predicate symbol ranging over semi-linear sets. We give new results both on the positive and negative side: we show that in first-order logic one cannot query a semi-linear set as to whether or not it contains a line, or whether or not it contains the line segment between two given points. However, we show that some of these queries become definable if one makes small restrictions on the semi-linear sets considered.



2001 ◽  
Vol 66 (3) ◽  
pp. 1321-1341 ◽  
Author(s):  
P. V. Andreev ◽  
E. I. Gordon

AbstractWe present an axiomatic framework for nonstandard analysis—the Nonstandard Class Theory (NCT) which extends von Neumann–Gödel–Bernays Set Theory (NBG) by adding a unary predicate symbol St to the language of NBG (St(X) means that the class X is standard) and axioms—related to it—analogs of Nelson's idealization, standardization and transfer principles. Those principles are formulated as axioms, rather than axiom schemes, so that NCT is finitely axiomatizable. NCT can be considered as a theory of definable classes of Bounded Set Theory by V. Kanovei and M. Reeken. In many aspects NCT resembles the Alternative Set Theory by P. Vopenka. For example there exist semisets (proper subclasses of sets) in NCT and it can be proved that a set has a standard finite cardinality iff it does not contain any proper subsemiset. Semisets can be considered as external classes in NCT. Thus the saturation principle can be formalized in NCT.



1998 ◽  
Vol 4 (4) ◽  
pp. 399-417 ◽  
Author(s):  
Juan Barba

§1. Introduction. The problem raised by the liar paradox has long been an intriguing challenge for all those interested in the concept of truth. Many “solutions” have been proposed to solve or avoid the paradox, either prescribing some linguistical restriction, or giving up the classical true-false bivalence or assuming some kind of contextual dependence of truth, among other possibilities. We shall not discuss these different approaches to the subject in this paper, but we shall concentrate on a kind of formal construction which was originated by Kripke's paper “Outline of a theory of truth” [11] and which, in different forms, reappears in later papers by various authors.The main idea can be presented as follows: assume a first order language ℒ containing, among other unspecified symbols, a predicate symbol T intended to represent the truth predicate for ℒ. Assume, also, a fixed model M = 〈D, I〉 (the base model)where D contains all sentences of ℒ and I interprets all non-logical symbols of ℒ except T in the usual way. In general, D might contain many objects other than sentences of ℒ but as that would raise the problem of the meaning of sentences in which T is applied to one of these objects, we shall assume that this is not the case.



1996 ◽  
Vol 61 (1) ◽  
pp. 250-276 ◽  
Author(s):  
Adam J. Grove ◽  
Joseph Y. Halpern ◽  
Daphne Koller

AbstractMotivated by problems that arise in computing degrees of belief, we consider the problem of computing asymptotic conditional probabilities for first-order sentences. Given first-order sentences φ and θ, we consider the structures with domain {1, …, N} that satisfy θ, and compute the fraction of them in which φ is true. We then consider what happens to this fraction as N gets large. This extends the work on 0-1 laws that considers the limiting probability of first-order sentences, by considering asymptotic conditional probabilities. As shown by Liogon'kiĭ [24], if there is a non-unary predicate symbol in the vocabulary, asymptotic conditional probabilities do not always exist. We extend this result to show that asymptotic conditional probabilities do not always exist for any reasonable notion of limit. Liogon'kiĭ also showed that the problem of deciding whether the limit exists is undecidable. We analyze the complexity of three problems with respect to this limit: deciding whether it is well-defined, whether it exists, and whether it lies in some nontrivial interval. Matching upper and lower bounds are given for all three problems, showing them to be highly undecidable.



1996 ◽  
Vol 4 ◽  
pp. 19-36 ◽  
Author(s):  
G. Brewka

The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension information about preferences between rules can be expressed in the logical language and derived dynamically. This is achieved by using a reserved predicate symbol and a naming technique. Conflicts among rules are resolved whenever possible on the basis of derived preference information. The well-founded conclusions of prioritized logic programs can be computed in polynomial time. A legal reasoning example illustrates the usefulness of the approach.



1994 ◽  
Vol 59 (3) ◽  
pp. 900-911 ◽  
Author(s):  
Hirotaka Kikyo ◽  
Akito Tsuboi

Let us consider countable languages L containing a unary predicate symbol P and L− =L\{P}. We also assume that L is relational. Then for any L-structure M, N = PM can naturally be considered as an L−-substructure of M. The main object of this paper will be the study of the following question: Under what condition does M have to be ℵ0-categorical. ℵ1-categorical, or stable if N is?Hodges and Pillay [6] proved that if M is a countable symmetric extension of N and T = Th(M) is minimal over P (they said that T is one-cardinal over P), then the total categoricity of N implies that of M. This is a solution to a problem in Ahlbrandt and Ziegler [1]. The condition that “M is a symmetric extension of N” is an interpretation of the condition “every relation on N definable in M is definable within N”. We shall give several interpretations of this phrase: They are the Ø-reduction property, the reduction property, the strong reduction property, and the uniform reduction property (Definition 1). Under the assumptions, we study the question proposed above.In §3 we treat the case that M is countable and show that if T is minimal over P and M has the strong reduction property over N, then M is ℵ0-categorical if N is (Theorem 5). This is a slight extension of the result of Hodges and Pillay mentioned above. (If M is countable and saturated, then the strong reduction property is equivalent to the condition that M will be symmetric over N if we add a finite number of appropriate constants.) A counterexample to this theorem has been obtained by Hrushovski in the case that only the Ø-reduction property is assumed. We also give a stronger result: If M has the Ø-reduction property over N and is ℵ0-categorical, M\N is infinite, and N is algebraically closed, then there is an expansion M* of M such that M* is not ℵo-categorical but M* still has the Ø-reduction property over N (Theorem 6). Moreover, we give an example such that M has the uniform reduction property over N. Th(M*) is minimal over P. N is ℵ0-categorical but M is not.



Sign in / Sign up

Export Citation Format

Share Document