Results 251 to 260 of about 16,427,329 (274)
Some of the next articles are maybe not open access.
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 Certainty Equivalence
Econometrica, 1969Summary: The classical certainty equivalence theorem states that the optimal decision in a risky situation is the same as in some associated riskless situation. It holds true under rather specific conditions: quadratic payoff, linear relations between instruments and results \(\ldots\).
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
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 logical
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 logical
openaire +1 more source
First-Order "Interruptible" Designs
Technometrics, 1982A well-designed experiment interrupted before its intended completion may prove inefficient and leave important questions unanswered. This article addresses the construction of “interruptible” designs for those cases in which a first-order model is assumed and factors at only two levels are considered.
Dennis E. Smith, Denise D. Schrmoyer
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
First Order Expressivist Logic
Erkenntnis, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2011
In the 1930s Kurt Godel Alonso Church, and Alan Turing laid important foundations for logic and, theoretical computer science. Of particular interest for AI are Godel’s theorems. The completeness theorem states that first-order predicate logic is complete.
openaire +1 more source
In the 1930s Kurt Godel Alonso Church, and Alan Turing laid important foundations for logic and, theoretical computer science. Of particular interest for AI are Godel’s theorems. The completeness theorem states that first-order predicate logic is complete.
openaire +1 more source
Logic Journal of IGPL, 1998
In previous work by \textit{H. Andréka, J. van Benthem}, and \textit{I. Németi} [ibid. 3, No. 5, 685-720 (1995; Zbl 0840.03010)], some finite-variable fragments of first-order logic were defined via Kripke-style translations of multi-modal logic. Then these fragments were proved to be decidable.
openaire +3 more sources
In previous work by \textit{H. Andréka, J. van Benthem}, and \textit{I. Németi} [ibid. 3, No. 5, 685-720 (1995; Zbl 0840.03010)], some finite-variable fragments of first-order logic were defined via Kripke-style translations of multi-modal logic. Then these fragments were proved to be decidable.
openaire +3 more sources
First-order differential equations
1975This book is a study of differential equations and their applications. A differential equation is a relationship between a function of time and its derivatives.
openaire +1 more source

