The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata

2003 ◽  
pp. 112-123 ◽  
Author(s):  
Arnaud Carayol ◽  
Stefan Wöhrle
Keyword(s):  
Higher Order ◽  
Infinite Graphs ◽  
Pushdown Automata

scholarly journals Collapsible Pushdown Parity Games

2021 ◽  
Vol 22 (3) ◽  
pp. 1-51
Author(s):  
Christopher H. Broadbent ◽  
Arnaud Carayol ◽  
Matthew Hague ◽  
Andrzej S. Murawski ◽  
C.-H. Luke Ong ◽  
...  
Keyword(s):  
Large Class ◽  
Winning Strategy ◽  
Higher Order ◽  
Infinite Graphs ◽  
Main Motivation ◽  
Infinite Trees ◽  
Depth Study ◽  
Parity Games ◽  
Pushdown Automata ◽  
Effective Representation

This article studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely, those generated by collapsible pushdown automata. The main motivation for studying these games comes from the connections from collapsible pushdown automata and higher-order recursion schemes, both models being equi-expressive for generating infinite trees. Our main result is to establish the decidability of such games and to provide an effective representation of the winning region as well as of a winning strategy. Thus, the results obtained here provide all necessary tools for an in-depth study of logical properties of trees generated by collapsible pushdown automata/recursion schemes.

scholarly journals Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties

2021 ◽  
Vol 22 (2) ◽  
pp. 1-37
Author(s):  
Christopher H. Broadbent ◽  
Arnaud Carayol ◽  
C.-H. Luke Ong ◽  
Olivier Serre
Keyword(s):  
Model Checking ◽  
Free Variable ◽  
Higher Order ◽  
Second Order ◽  
Effective Solution ◽  
Parity Games ◽  
Transition Graphs ◽  
Second Order Logic ◽  
Pushdown Automata ◽  
Monadic Second Order Logic

This article studies the logical properties of a very general class of infinite ranked trees, namely, those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal -calculus, three main problems: model-checking, logical reflection (a.k.a. global model-checking, that asks for a finite description of the set of elements for which a formula holds), and selection (that asks, if exists, for some finite description of a set of elements for which an MSO formula with a second-order free variable holds). For each of these problems, we provide an effective solution. This is obtained, thanks to a known connection between higher-order recursion schemes and collapsible pushdown automata and on previous work regarding parity games played on transition graphs of collapsible pushdown automata.

scholarly journals Unboundedness and downward closures of higher-order pushdown automata

2016 ◽  
Vol 51 (1) ◽  
pp. 151-163 ◽  
Author(s):  
Matthew Hague ◽  
Jonathan Kochems ◽  
C.-H. Luke Ong
Keyword(s):  
Higher Order ◽  
Pushdown Automata

Dual systems for all: Higher-order, role-based relational reasoning as a uniquely derived feature of human cognition

2019 ◽  
Vol 42 ◽  
Author(s):  
Daniel J. Povinelli ◽  
Gabrielle C. Glorioso ◽  
Shannon L. Kuznar ◽  
Mateja Pavlic
Keyword(s):  
Temporal Reasoning ◽  
Higher Order ◽  
Important Case ◽  
Human Cognition ◽  
Relational Reasoning ◽  
Dual Systems ◽  
First Order ◽  
Reasoning System ◽  
Role Based

Abstract Hoerl and McCormack demonstrate that although animals possess a sophisticated temporal updating system, there is no evidence that they also possess a temporal reasoning system. This important case study is directly related to the broader claim that although animals are manifestly capable of first-order (perceptually-based) relational reasoning, they lack the capacity for higher-order, role-based relational reasoning. We argue this distinction applies to all domains of cognition.

Quantitative EPMA of nitrogen : A tricky element in the electron-probe microanalyzer

1992 ◽  
Vol 50 (2) ◽  
pp. 1622-1623
Author(s):  
G.F. Bastin ◽  
H.J.M. Heijligers
Keyword(s):  
Background Subtraction ◽  
Electron Probe ◽  
Detection System ◽  
Higher Order ◽  
Light Elements ◽  
Strong Suppression ◽  
Electron Probe Microanalyzer ◽  
Quantitative Epma ◽  
Peak Count ◽  
Lead Stearate

Among the ultra-light elements B, C, N, and O nitrogen is the most difficult element to deal with in the electron probe microanalyzer. This is mainly caused by the severe absorption that N-Kα radiation suffers in carbon which is abundantly present in the detection system (lead-stearate crystal, carbonaceous counter window). As a result the peak-to-background ratios for N-Kα measured with a conventional lead-stearate crystal can attain values well below unity in many binary nitrides . An additional complication can be caused by the presence of interfering higher-order reflections from the metal partner in the nitride specimen; notorious examples are elements such as Zr and Nb. In nitrides containing these elements is is virtually impossible to carry out an accurate background subtraction which becomes increasingly important with lower and lower peak-to-background ratios. The use of a synthetic multilayer crystal such as W/Si (2d-spacing 59.8 Å) can bring significant improvements in terms of both higher peak count rates as well as a strong suppression of higher-order reflections.

Effects of Higher-Order Laue Zone reflections on structure images

1993 ◽  
Vol 51 ◽  
pp. 450-451
Author(s):  
H. S. Kim ◽  
S. S. Sheinin
Keyword(s):  
Wave Vector ◽  
Theoretical Calculations ◽  
Reciprocal Lattice ◽  
Image Plane ◽  
Bloch Wave ◽  
Dynamical Theory ◽  
Higher Order ◽  
Lattice Image ◽  
Lattice Vector ◽  
Image Position

The importance of image simulation in interpreting experimental lattice images is well established. Normally, in carrying out the required theoretical calculations, only zero order Laue zone reflections are taken into account. In this paper we assess the conditions for which this procedure is valid and indicate circumstances in which higher order Laue zone reflections may be important. Our work is based on an analysis of the requirements for obtaining structure images i.e. images directly related to the projected potential. In the considerations to follow, the Bloch wave formulation of the dynamical theory has been used.The intensity in a lattice image can be obtained from the total wave function at the image plane is given by: where ϕg(z) is the diffracted beam amplitide given by In these equations,the z direction is perpendicular to the entrance surface, g is a reciprocal lattice vector, the Cg(i) are Fourier coefficients in the expression for a Bloch wave, b(i), X(i) is the Bloch wave excitation coefficient, ϒ(i)=k(i)-K, k(i) is a Bloch wave vector, K is the electron wave vector after correction for the mean inner potential of the crystal, T(q) and D(q) are the transfer function and damping function respectively, q is a scattering vector and the summation is over i=l,N where N is the number of beams taken into account.

Sign in / Sign up

Export Citation Format

Share Document