On the undecidability of finite planar graphs

1971 ◽  
Vol 36 (1) ◽  
pp. 121-126 ◽  
Author(s):  
Solomon Garfunkel ◽  
Herbert Shank
Keyword(s):  
Planar Graphs ◽  
Equivalence Relations ◽  
Original Graph ◽  
First Order ◽  
Semantic Embedding ◽  
Different Types ◽  
Hereditary Undecidability

In this paper we demonstrate the hereditary undecidability of finite planar graphs. In §2 we introduce the preliminary logical notions used and outline the Rabin–Scott method of semantic embedding. This method is illustrated in §3 by proving the undecidability of the theory of two finite equivalence relations of a special type. In §4 we give a proof of the main theorem by embedding these equivalence relations into finite planar graphs.The basic idea is first to form a graph which codes a pair of these relations and then to take a representative of it and “squish” it to the plane. This “squishing” requires the introduction of crossings; and edges of the original graph become paths in the new one. To distinguish the original edges we place two different types of “diamonds” about crossing points. We can then uncode our new graphs to recover the equivalence relations by means of simple first-order incidence properties.

On the undecidability of finite planar cubic graphs

1972 ◽  
Vol 37 (3) ◽  
pp. 595-597
Author(s):  
Solomon Garfunkel ◽  
Herbert Shank
Keyword(s):  
Planar Graphs ◽  
Order Theory ◽  
Cubic Graphs ◽  
Binary Relations ◽  
Planar Case ◽  
First Order ◽  
First Order Theory ◽  
Essential Idea ◽  
Arbitrary Graphs ◽  
Hereditary Undecidability

In the March, 1971 issue of this Journal [1] a paper of ours was published purporting to prove the hereditary undecidability of the first-order theory of finite planar graphs. The proof presented there contains an error which is unfortunately “unfixable” by the methods of that paper. The theorem however is true and we demonstrate here a generalization to finite cubic (exactly three edges at each vertex) planar graphs. The method involves coding the halting problem for a Turing machine into the theory of these graphs by considering special printouts of computations. Let us first consider a discussion of the aforementioned mistake and see what can be learned from it.By a graph we will mean a nonempty set V of points together with a set I of unordered pairs of points of V. Each point i = {u, v) ∈ I is an edge of A graph is called finite if ∣V∣ is finite. A graph is said to be planar iff it can be embedded in the plane (i.e., drawn in the plane so that no two edges intersect).In the earlier paper the method of proof was a semantic embedding of certain binary relations into finite planar graphs. The essential idea was, for a given relation, to let the vertices of the graph interpret the field of the relation and the edges represent the related pairs. This method works for arbitrary graphs, but in the planar case has two main difficulties.

Post-Non-Classical World View in the On-Screen Reality of the Digital Epoch

2015 ◽  
pp. 4-12
Author(s):  
Elena V. Nikolaeva
Keyword(s):  
World View ◽  
Dynamic Chaos ◽  
Digital Culture ◽  
Fractal Nature ◽  
Late 20Th Century ◽  
First Order ◽  
Classical World ◽  
Different Types ◽  
Strange Loops ◽  
Cultural World

The article analyzes the correlation between the screen reality and the first-order reality in the digital culture. Specific concepts of the scientific paradigm of the late 20th century are considered as constituent principles of the on-screen reality of the digital epoch. The study proves that the post-non-classical cultural world view, emerging from the dynamic “chaos” of informational and semantic rows of TV programs and cinematographic narrations, is of a fractal nature. The article investigates different types of fractality of the TV content and film plots, their inner and outer “strange loops” and artistic interpretations of the “butterfly effect”.

Quantitative Models of Motor Responses Subject to Longitudinal, Lateral, and Preview Constraints

1978 ◽  
Vol 20 (1) ◽  
pp. 35-39 ◽  
Author(s):  
Tarald O. Kvålseth
Keyword(s):  
Experimental Data ◽  
Motor Control ◽  
Linear Models ◽  
Movement Time ◽  
Arm Movements ◽  
Second Order ◽  
Motor Responses ◽  
First Order ◽  
Different Types ◽  
Index Of Difficulty

First- and second-order linear models of mean movement time for serial arm movements aimed at a target and subject to preview constraints and lateral constraints were formulated as extensions of the so-called Fitts's law of motor control. These models were validated on the basis of experimental data from five subjects and found to explain from 80% to 85% of the variation in movement time in the case of the first-order models and from 93% to 95% of such variation for the second-order models. Fitts's index of difficulty (ID) was generally found to contribute more to the movement time than did either the preview ID or the lateral ID defined. Of the different types of errors, target overshoots occurred far more frequently than undershoots.

Resolution in type theory

1971 ◽  
Vol 36 (3) ◽  
pp. 414-432 ◽  
Author(s):  
Peter B. Andrews
Keyword(s):  
Set Theory ◽  
Type Theory ◽  
Higher Order ◽  
Order Logic ◽  
First Order Logic ◽  
Higher Order Logic ◽  
First Order ◽  
Different Types ◽  
Axiomatic Set Theory ◽  
Order Predicate Calculus

In [8] J. A. Robinson introduced a complete refutation procedure called resolution for first order predicate calculus. Resolution is based on ideas in Herbrand's Theorem, and provides a very convenient framework in which to search for a proof of a wff believed to be a theorem. Moreover, it has proved possible to formulate many refinements of resolution which are still complete but are more efficient, at least in many contexts. However, when efficiency is a prime consideration, the restriction to first order logic is unfortunate, since many statements of mathematics (and other disciplines) can be expressed more simply and naturally in higher order logic than in first order logic. Also, the fact that in higher order logic (as in many-sorted first order logic) there is an explicit syntactic distinction between expressions which denote different types of intuitive objects is of great value where matching is involved, since one is automatically prevented from trying to make certain inappropriate matches. (One may contrast this with the situation in which mathematical statements are expressed in the symbolism of axiomatic set theory.).

Small substructures and decidability issues for first-order logic with two variables

2012 ◽  
Vol 77 (3) ◽  
pp. 729-765 ◽  
Author(s):  
Emanuel Kieroński ◽  
Martin Otto
Keyword(s):  
Order Logic ◽  
First Order Logic ◽  
Equivalence Relations ◽  
Finite Model ◽  
Model Property ◽  
Finite Model Property ◽  
First Order ◽  
Surrounding Structure ◽  
Small Model ◽  
Exponential Size

AbstractWe study first-order logic with two variables FO2 and establish a small substructure property. Similar to the small model property for FO2 we obtain an exponential size bound on embedded substructures, relative to a fixed surrounding structure that may be infinite. We apply this technique to analyse the satisfiability problem for FO2 under constraints that require several binary relations to be interpreted as equivalence relations. With a single equivalence relation, FO2 has the finite model property and is complete for non-deterministic exponential time, just as for plain FO2. With two equivalence relations, FO2 does not have the finite model property, but is shown to be decidable via a construction of regular models that admit finite descriptions even though they may necessarily be infinite. For three or more equivalence relations, FO2 is undecidable.

scholarly journals Scalar field cosmology in Lyra's geometry

2015 ◽  
Vol 3 (2) ◽  
pp. 117 ◽  
Author(s):  
V. K. Shchigolev ◽  
E. A. Semenova
Keyword(s):  
Exact Solution ◽  
Scalar Field ◽  
Generating Function ◽  
Function Method ◽  
Scalar Fields ◽  
First Order ◽  
Homogeneous Cosmological Models ◽  
Different Types ◽  
Lyra’S Geometry ◽  
Scalar Field Cosmology

<p>The new classes of homogeneous cosmological models for the scalar fields are build in the context of Lyra’s geometry. The different types of exact solution for the model are obtained by applying two procedures, viz the generating function method and the first order formalism.</p>

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 Theoretical framework for higher-order quantum theory

2019 ◽  
Vol 475 (2225) ◽  
pp. 20180706 ◽  
Author(s):  
Alessandro Bisio ◽  
Paolo Perinotti
Keyword(s):  
Quantum Theory ◽  
Convex Sets ◽  
Mathematical Structure ◽  
Higher Order ◽  
Equivalence Relations ◽  
Full Generality ◽  
Special Cases ◽  
Different Types ◽  
Causal Structures

Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes recursively, with the construction of a full hierarchy of maps of increasingly higher order. The analysis of special cases already showed that higher-order quantum functions exhibit features that cannot be tracked down to the usual circuits, such as indefinite causal structures, providing provable advantages over circuital maps. The present treatment provides a general framework where this kind of analysis can be carried out in full generality. The hierarchy of higher-order quantum maps is introduced axiomatically with a formulation based on the language of types of transformations. Complete positivity of higher-order maps is derived from the general admissibility conditions instead of being postulated as in previous approaches. The recursive characterization of convex sets of maps of a given type is used to prove equivalence relations between different types. The axioms of the framework do not refer to the specific mathematical structure of quantum theory, and can therefore be exported in the context of any operational probabilistic theory.

Factors Influencing the Measurement of Slipperiness

1988 ◽  
Vol 32 (9) ◽  
pp. 545-548 ◽  
Author(s):  
Mark S. Redfern
Keyword(s):  
Coefficient Of Friction ◽  
Interaction Effect ◽  
Vertical Force ◽  
Dynamic Tests ◽  
Order Interaction ◽  
First Order ◽  
Factors Influencing ◽  
Different Types ◽  
Velocity Effect

The evaluation and prevention of slips and falls require methods of quantifying the slipperiness of floors. The concept of coefficient of friction (COF) has been and continues to be commonly used as one such method. The objective of this paper is to present some results from investigations into the effects of vertical force and velocity on COF measures for different types of floors. Tests involving both static COF (SCOF) and dynamic COF (DCOF) measurements were performed under various conditions. It was found that the SCOF changed as a function of the vertical force used. Generally, the SCOF increased as the vertical force was increased. This was not true, however, for tile floors. It was also found that there was a significant first order interaction effect on the SCOF between vertical weight and the condition of the floor (wet or dry). The dynamic tests showed that velocity of the shoe material with respect to the floor had a large effect on the DCOF values obtained. The velocity effect was dependent on the shoe material and the conditions tested. Possible reasons for these findings and ramifications on slip testing are presented.

Global energetics of fast magnetic reconnection

1988 ◽  
Vol 40 (3) ◽  
pp. 505-515 ◽  
Author(s):  
M. Jardine ◽  
E. R. Priest
Keyword(s):  
Steady State ◽  
Total Energy ◽  
Second Order ◽  
Weakly Nonlinear ◽  
First Order ◽  
Weakly Nonlinear Theory ◽  
Special Cases ◽  
Pile Up ◽  
Different Types ◽  
Converging Flow

We examine the global energetics of a recent weakly nonlinear theory of fast steady-state reconnection in an incompressible plasma (Jardine & Priest 1988). This is itself an extension to second order of the Priest & Forbes (1986) family of models, of which Petschek-like and Sonnerup-like solutions are special cases. While to first order we find that the energy conversion is insensitive to the type of solution (such as slow compression or flux pile-up), to second order not only does the total energy converted vary but so also does the ratio of the thermal to kinetic energies produced. For a slow compression with a strongly converging flow, the amount of energy converted is greatest and is dominated by the thermal contribution, while for a flux pile-up with a strongly diverging flow, the amount of energy converted is smallest and is dominated by the kinetic contribution. We also find that the total energy flowing out of the downstream region can be increased either by increasing the external magnetic Mach number Me or the external plasma beta βe Increasing Me also enhances the variations between different types of solutions.

Sign in / Sign up

Export Citation Format

Share Document