G. Fuhrken. Skolem-type normal forms for first-order languages with a generalized quantifier. Fundamenta mathematicae, vol. 54 (1964), pp. 291–302. - R. L. Vaught. The completeness of logic with the added quantifier “there are uncountably many.”Fundamenta mathematicae, vol. 54 (1964), pp. 303–304.

1968 ◽  
Vol 33 (1) ◽  
pp. 121-122
Author(s):  
Paweł Zbierski
Keyword(s):  
Normal Forms ◽  
First Order ◽  
Generalized Quantifier

A SUFFICIENT CONDITION FOR THE UNIQUENESS OF NORMAL FORMS AND UNIQUE NORMAL FORMS OF GENERALIZED HOPF SINGULARITIES

2004 ◽  
Vol 14 (09) ◽  
pp. 3337-3345 ◽  
Author(s):  
JIANPING PENG ◽  
DUO WANG
Keyword(s):  
Normal Form ◽  
Normal Forms ◽  
Sufficient Condition ◽  
First Order ◽  
Recursive Formulas ◽  
Unique Normal Forms

A sufficient condition for the uniqueness of the Nth order normal form is provided. A new grading function is proposed and used to prove the uniqueness of the first-order normal forms of generalized Hopf singularities. Recursive formulas for computation of coefficients of unique normal forms of generalized Hopf singularities are also presented.

An axiomatization of the logic with the rough quantifier

1991 ◽  
Vol 56 (2) ◽  
pp. 608-617 ◽  
Author(s):  
Michał Krynicki ◽  
Hans-Peter Tuschik
Keyword(s):  
Equivalence Relation ◽  
Equivalence Relations ◽  
Order Structure ◽  
Partition Model ◽  
Weak Model ◽  
First Order ◽  
Basic Properties ◽  
Generalized Quantifier ◽  
Order Language ◽  
The Right

We consider the language L(Q), where L is a countable first-order language and Q is an additional generalized quantifier. A weak model for L(Q) is a pair 〈, q〉 where is a first-order structure for L and q is a family of subsets of its universe. In case that q is the set of classes of some equivalence relation the weak model 〈, q〉 is called a partition model. The interpretation of Q in partition models was studied by Szczerba [3], who was inspired by Pawlak's paper [2]. The corresponding set of tautologies in L(Q) is called rough logic. In the following we will give a set of axioms of rough logic and prove its completeness. Rough logic is designed for creating partition models.The partition models are the weak models arising from equivalence relations. For the basic properties of the logic of weak models the reader is referred to Keisler's paper [1]. In a weak model 〈, q〉 the formulas of L(Q) are interpreted as usual with the additional clause for the quantifier Q: 〈, q〉 ⊨ Qx φ(x) iff there is some X ∊ q such that 〈, q〉 ⊨ φ(a) for all a ∊ X.In case X satisfies the right side of the above equivalence we say that X is contained in φ(x) or, equivalently, φ(x) contains X.

scholarly journals GEOMETRISATION OF FIRST-ORDER LOGIC

2015 ◽  
Vol 21 (2) ◽  
pp. 123-163 ◽  
Author(s):  
ROY DYCKHOFF ◽  
SARA NEGRI
Keyword(s):  
Proof Theory ◽  
Normal Forms ◽  
Order Theory ◽  
Order Logic ◽  
First Order Logic ◽  
Conservative Extension ◽  
First Order ◽  
First Order Theory ◽  
Intermediate Logics ◽  
Normal Form Theorem

AbstractThat every first-order theory has a coherent conservative extension is regarded by some as obvious, even trivial, and by others as not at all obvious, but instead remarkable and valuable; the result is in any case neither sufficiently well-known nor easily found in the literature. Various approaches to the result are presented and discussed in detail, including one inspired by a problem in the proof theory of intermediate logics that led us to the proof of the present paper. It can be seen as a modification of Skolem’s argument from 1920 for his “Normal Form” theorem. “Geometric” being the infinitary version of “coherent”, it is further shown that every infinitary first-order theory, suitably restricted, has a geometric conservative extension, hence the title. The results are applied to simplify methods used in reasoning in and about modal and intermediate logics. We include also a new algorithm to generate special coherent implications from an axiom, designed to preserve the structure of formulae with relatively little use of normal forms.

scholarly journals Local Normal Forms for First-Order Logic with Applications to Games and Automata

1999 ◽  
Vol Vol. 3 no. 3 ◽  
Author(s):  
Thomas Schwentick ◽  
Klaus Barthelmann
Keyword(s):  
Normal Forms ◽  
Winning Strategy ◽  
Expressive Power ◽  
Second Order ◽  
Order Logic ◽  
First Order Logic ◽  
First Order ◽  
Relational Structures ◽  
Second Order Logic ◽  
Monadic Second Order Logic

International audience Building on work of Gaifman [Gai82] it is shown that every first-order formula is logically equivalent to a formula of the form ∃ x_1,...,x_l, \forall y, φ where φ is r-local around y, i.e. quantification in φ is restricted to elements of the universe of distance at most r from y. \par From this and related normal forms, variants of the Ehrenfeucht game for first-order and existential monadic second-order logic are developed that restrict the possible strategies for the spoiler, one of the two players. This makes proofs of the existence of a winning strategy for the duplicator, the other player, easier and can thus simplify inexpressibility proofs. \par As another application, automata models are defined that have, on arbitrary classes of relational structures, exactly the expressive power of first-order logic and existential monadic second-order logic, respectively.

scholarly journals SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION

2019 ◽  
Vol 12 (3) ◽  
pp. 456-486 ◽  
Author(s):  
FAUSTO BARBERO
Keyword(s):  
Imperfect Information ◽  
Proof Theory ◽  
Higher Order ◽  
Generalized Quantifiers ◽  
First Order ◽  
Generalized Quantifier ◽  
Team Semantics ◽  
Special Cases ◽  
Qualitative Component ◽  
Definition Of

AbstractWe analyse the two definitions of generalized quantifiers for logics of dependence and independence that have been proposed by F. Engström, comparing them with a more general, higher order definition of team quantifier. We show that Engström’s definitions (and other quantifiers from the literature) can be identified, by means of appropriate lifts, with special classes of team quantifiers. We point out that the new team quantifiers express a quantitative and a qualitative component, while Engström’s quantifiers only range over the latter. We further argue that Engström’s definitions are just embeddings of the first-order generalized quantifiers into team semantics, and fail to capture an adequate notion of team-theoretical generalized quantifier, save for the special cases in which the quantifiers are applied to flat formulas. We also raise several doubts concerning the meaningfulness of the monotone/nonmonotone distinction in this context. In the appendix we develop some proof theory for Engström’s quantifiers.

scholarly journals Applying the method of normal forms to second-order nonlinear vibration problems

2010 ◽  
Vol 467 (2128) ◽  
pp. 1141-1163 ◽  
Author(s):  
Simon A. Neild ◽  
David J. Wagg
Keyword(s):  
Normal Form ◽  
Nonlinear Vibration ◽  
Normal Forms ◽  
Equations Of Motion ◽  
Second Order ◽  
Form Analysis ◽  
First Order ◽  
Invariance Properties ◽  
Vibration Problems ◽  
Second Order Equations

Vibration problems are naturally formulated with second-order equations of motion. When the vibration problem is nonlinear in nature, using normal form analysis currently requires that the second-order equations of motion be put into first-order form. In this paper, we demonstrate that normal form analysis can be carried out on the second-order equations of motion. In addition, for forced, damped, nonlinear vibration problems, we show that the invariance properties of the first- and second-order transforms differ. As a result, using the second-order approach leads to a simplified formulation for forced, damped, nonlinear vibration problems.

Finite partially-ordered quantification

1970 ◽  
Vol 35 (4) ◽  
pp. 535-555 ◽  
Author(s):  
Wilbur John Walkoe
Keyword(s):  
Partial Order ◽  
Normal Forms ◽  
Second Order ◽  
Infinitary Logic ◽  
First Order ◽  
Partially Ordered ◽  
Order Language

In [3] Henkin made the observation that certain second-order existential formulas may be thought of as the Skolem normal forms of formulas of a language which is first-order in every respect except its incorporation of a form of partially-ordered quantification. One formulation of this sort of language is the closure of a first-order language under the formation rule that Qφ is a formula whenever φ is a formula and Q, which is to be thought of as a quantifier-prefix, is a system of partial order whose universe is a set of quantifiers. Although he introduced this idea in a discussion of infinitary logic, Henkin went on to discuss its application to finitary languages, and he concluded his discussion with a theorem of Ehrenfeucht that the incorporation of an extremely simple partially-ordered quantifier-prefix (the quantifiers ∀x, ∀y, ∃v, and ∃w, with the ordering {〈∀x, ∃v〉, 〈∀y, ∃w〉}) into any first-order language with identity gives a language capable of expressing the infinitary quantifier ∃zκ0x.

A Study on Information-Preserving Schema Transformations

2020 ◽  
Vol 14 (01) ◽  
pp. 27-53
Author(s):  
Nonyelum Ndefo ◽  
Enrico Franconi
Keyword(s):  
Reverse Engineering ◽  
Normal Forms ◽  
Knowledge Bases ◽  
Information Capacity ◽  
Constructive Approach ◽  
First Order ◽  
Relative Information ◽  
Information Contents ◽  
Insight Into ◽  
Schema Transformation

The problem of determining the relative information capacity between two knowledge bases or schemas, of the same or different models, is inherent when implementing schema transformations. When restructuring one schema into another, one expects that the schema transformation supports the complete and correct mapping of all the information contents from the source schema to the target schema. Such a characteristic is commonly referred to as information capacity preservation or schema dominance. This paper presents a formal and constructive approach to measure the relative information capacity, in the restricted case of first-order schemas related by first-order mappings. It complements the existing definitions of information capacity preservation from the perspective of model theory, showing the exact relationships among the constraints of the involved schemas, the mappings between the components of these schemas, and the database states which the schemas admit. Since satisfying some sort of schema equivalence property is essential in areas such as database conceptual design and database reverse engineering, our approach allows us to characterize the notion of normalization in database design. We review the current literature concerning database normal forms and decompositions. We also review the process of reverse engineering a database schema. In addition, we provide deeper insight into database reverse engineering methodologies, suggesting horizontal decompositions as a useful tool for facilitating the discovery of more specific objects and relationships in the conceptualization phase of the process. With the aid of simple examples, we show the essence behind our reasoning. We discuss the need for an unambiguous means through which objects in the output schema can be identified. Ultimately, the knowledge this paper ensues will be beneficial to database engineers in performing a correct schema transformation.

Sign in / Sign up

Export Citation Format

Share Document