Results 131 to 140 of about 4,414,858 (168)
Some of the next articles are maybe not open access.
2018
In Chapter 3, we did a quick check to see if the initial entry of our OSDlens was correct using the command FIR. The first-order listing for OSDlens is shown again in Table 4.1. The first three numbers may be puzzling because there are three separate focal lengths (EFL, BFL, and FFL) listed, and one of them is negative.
Julie L. Bentley, Donald C. O'Shea
openaire +1 more source
In Chapter 3, we did a quick check to see if the initial entry of our OSDlens was correct using the command FIR. The first-order listing for OSDlens is shown again in Table 4.1. The first three numbers may be puzzling because there are three separate focal lengths (EFL, BFL, and FFL) listed, and one of them is negative.
Julie L. Bentley, Donald C. O'Shea
openaire +1 more source
First-Order Logic and First-Order Functions
Logica Universalis, 2015This paper begins the study of first-order functions, which are a generalization of truth-functions. The concepts of truth-table and systems (and clones) of truth-functions, both introduced in propositional logic by Post, are also generalized and studied in the quantificational setting. The general facts about these concepts are given in the first five
openaire +1 more source
Journal of Logic, Language and Information, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
First-order and pseudo-first-order elimination kinetics
Science of The Total Environment, 1991There is evidence that, for a number of chemicals, the elimination characteristics during bioconcentration do not follow monophasic first-order kinetics. In the first part of the present communication, a simple mathematical formula is presented that allows a clear-cut distinction between monophasic (pseudo-) and first-order and morephasic or higher ...
openaire +2 more sources
First-order sources in first-order systems: second-order correlations
Applied Optics, 1991The laws of propagation of the second-order correlation of a generalized Gaussian Schell-model source in first-order systems are deduced from the canonical operator formalism. A far-reaching generalization of Kogelnik's q parameter is derived, valid in n dimensions, for misaligned, lossy, and anisotropic sources and systems. Even in one dimension these
openaire +2 more sources
Locality of order-invariant first-order formulas
ACM Transactions on Computational Logic, 1998A query is local if the decision of whether a tuple in a structure satisfies this query only depends on a small neighborhood of the tuple. We prove that all queries expressible by order-invariant first-order formulas are local.
Grohe, Martin, Schwentick, Thomas
openaire +2 more sources
Relating Higher-order and First-order Rewriting
Journal of Logic and Computation, 2005We define a formal encoding from higher-order rewriting into first-order rewriting modulo an equational theory. In particular, we obtain a characterization of the class of higher-order rewriting systems which can be encoded by first-order rewriting modulo an empty equational theory (that is, = o). This class includes of course the λ-calculus.
Bonelli, Eduardo +2 more
openaire +2 more sources
Proceedings of the AAAI Conference on Artificial Intelligence
First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification language for the verification of complex infinite-state systems is appealing.
Geatti L., Gianola A., Gigante N.
openaire +1 more source
First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification language for the verification of complex infinite-state systems is appealing.
Geatti L., Gianola A., Gigante N.
openaire +1 more source
1997
Abstract This chapter concerns some connections between graph theory and first-order logic. After an introduction to first-order logic and a discussion of which graph properties are first-order, we consider logical concepts such as ℵ0-categoricity and homogeneity for graphs, and present some theorems about finite graphs requiring ...
openaire +1 more source
Abstract This chapter concerns some connections between graph theory and first-order logic. After an introduction to first-order logic and a discussion of which graph properties are first-order, we consider logical concepts such as ℵ0-categoricity and homogeneity for graphs, and present some theorems about finite graphs requiring ...
openaire +1 more source
SIAM Journal on Computing, 1974
In this paper we consider first order context-free, linear, and regular graph grammars and obtain many results similar to those for the corresponding string grammars. We obtain normal forms for context-free and regular graph grammars, simplification lemmas, and algorithms for membership, emptiness, finiteness and infiniteness.
openaire +1 more source
In this paper we consider first order context-free, linear, and regular graph grammars and obtain many results similar to those for the corresponding string grammars. We obtain normal forms for context-free and regular graph grammars, simplification lemmas, and algorithms for membership, emptiness, finiteness and infiniteness.
openaire +1 more source