๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Loop-separable programs and their first-order definability

โœ Scribed by Yin Chen; Fangzhen Lin; Yan Zhang; Yi Zhou

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
399 KB
Volume
175
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Universal First-Order Definability in Mo
Universal First-Order Definability in Modal Logic
โœ R. E. Jennings; D. K. Johnston; P. K. Schotch ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 198 KB

UPiIVERSAL FIRST-ORDER DEFINABILITY I N MODAL LOGIC by R. E. JENNIXGS and D. K. JOHNSTON in Burnaby, British Columbia (Canada) and P. K. SCHOTCH in Halifax, Nova Scotia (Canada)l) In [ l ] R. I. GOLDBLATT presents a model theoretic characterization of the class of modal sentences determined by firs

Perception of first- and second-order mo
Perception of first- and second-order motion: Separable neurological mechanisms?
โœ Lucia M. Vaina; Alan Cowey; David Kennedy ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 709 KB

An unresolved issue in visual motion perception is how distinct are the processes underlying "first-order" and "second-order" motion. The former is defined by spatiotemporal variations of luminance and the latter by spatiotemporal variations in other image attributes, such as contrast or depth. Here

Decidability and Definability Results Co
Decidability and Definability Results Concerning Well-Orderings and Some Extensions of First Order Logic
โœ Bogdan Stanislaw Chlebus ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 452 KB

DECIDABILITY AND DEFINABILITY RESULTS CONCERNING WELL-ORDERINGS AND SOME EXTENSIONS OF FIRST ORDER LOGIC by BOGDAN STANISLAW CHLEBUS in Warsaw (Poland) ## 1. Introdiirtion Let L\* denote a countable extension of the first order language L. I n this paper 1 ) definability of the class of well-order

Program schemata and the first-order dec
Program schemata and the first-order decision problem
โœ Harry R. Lewis ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 594 KB

In [7] Manna reduces certain decision problems for program schemata to the problem of determining whether or not a first-order formula is satisfiable. Here we give an improved construction, which yields new positive results and suggests a method that may be useful in further investigations.