181 search results - page 31 / 37 » On Quantification with A Finite Universe |
AO
2007
13 years 7 months ago
2007
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This paper studies two kinds of simulation between cellular automata: simulations based on factor and simulations based on sub-automaton. We show that these two kinds of simulation...
EATCS
2000
13 years 7 months ago
2000
One of the previous articles in this column was devoted to the zero-one laws for a number of logics playing prominent role in finite model theory: first-order logic FO, the extens...
JSCIC
2000
13 years 7 months ago
2000
In [6], the Ghost Fluid Method (GFM) was developed to capture the boundary conditions at a contact discontinuity in the inviscid compressible Euler equations. In [11], related tec...