Примери коришћења First-order на Енглеском и њихови преводи на Српски
{-}
-
Colloquial
-
Ecclesiastic
-
Computer
-
Latin
-
Cyrillic
Satisfiability in first-order logic.
First-order theory of arithmetic.
Computing with first-order logic.
The first-order differential equation.
Converting from first-order logic.
Људи такође преводе
The first-order theory of Euclidean geometry, established by Tarski in 1949.
Non-reducibility to first-order logic.
Heterogeneous first-order nonlinear ordinary differential equation.
A noticeable bag is a first-order thing.
In the case of a first-order approximation, at least one number given is exact.
The validity problem for first-order logic.
The first-order theory of Boolean algebras, established by Alfred Tarski in 1949.
Stability of nonlinear first-order recurrences.
The first-order theory of real-closed ordered fields, established by Tarski in 1949.
It provides a concise language base on first-order relational logic.
The first-order theory of algebraically closed fields of a given characteristic, established by Tarski in 1949.
Church proved that Peano arithmetic and first-order logic are undecidable.
A first-order RL circuit is composed of one resistor and one inductor and is the simplest type of RL circuit.
Don't believe the thirty-third-order consequences of a first-order model.
Similarly, the class I is first-order logic with the commutative, transitive closure.
It has recently been extended for automated theorem proving for fragments of first-order logic.
This situation cannot be avoided with any first-order formalization of set theory.
The compactness theorem implies that the existence of nonstandard elements cannot be excluded in first-order logic.
For example, the set of logical validities V of first-order logic is semi-decidable, but not decidable.
The arithmetical hierarchy assigns classifications to the formulas in the language of first-order arithmetic.
The first-order theory of the rational numbers with addition, multiplication, and equality, established by Julia Robinson in 1949.
Similarly, the set of logical consequences of any recursively enumerable set of first-order axioms is semidecidable.
The illusion of first-order perception is possible only by establishing absolute trust starting from the agreed-upon level of abstraction.
For each formula φ(x, y1,…,yk)in the language of Peano arithmetic, the first-order induction axiom for φ is the sentence.
A first-order saddle point is a critical point of index one, that is, a position on the PES corresponding to a minimum in all directions except one.