Results 271 to 280 of about 12,123 (304)

A reduction theorem for normal algorithms

Journal of Symbolic Logic, 1966
Markov's [2] notion of Normal Algorithm (NA), with which we assume familiarity, is the simplest of the better known ways of expressing the concept of algorithmicity. An NA consists of an ordered finite list of replacement formulae The dots in parentheses indicate that a given replacement formula may be either simple (P → Q), or terminal (P → .Q).
openaire   +2 more sources

Borel’s normal number theorem

The Mathematical Gazette, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On Fedorchuk’s normal functor theorem

Mathematical Notes, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A normalization theorem for set theory

Journal of Symbolic Logic, 1988
In this paper we present a normalization theorem for a natural deduction formulation of Zermelo set theory. Our result gets around M.
openaire   +1 more source

Refinements of Vaught's normal from theorem

Journal of Symbolic Logic, 1979
The central notion of this paper is that of a (conjunctive) game-sentence, i.e., a sentence of the formwhere the indices ki, ji range over given countable sets and the matrix conjuncts are, say, open -formulas. Such game sentences were first considered, independently, by Svenonius [19], Moschovakis [13]—[15] and Vaught [20].
openaire   +1 more source

EVANS' NORMAL FORM THEOREM REVISITED

International Journal of Algebra and Computation, 2007
Evans defined quasigroups equationally, and proved a Normal Form Theorem solving the word problem for free extensions of partial Latin squares. In this paper, quasigroups are redefined as algebras with six basic operations related by triality, manifested as coupled right and left regular actions of the symmetric group on three symbols.
openaire   +1 more source

A normal form theorem for label grammars

Mathematical Systems Theory, 1981
We characterize the images of Szilard languages under decreasing homomorphisms using so-called label grammars and show that each λ-free label language is in fact the coding of some Szilard language. This result shows that decreasing homomorphisms do not have more generating power on Szilard languages than codings, except that they generate the empty ...
Matthias Jantzen, Manfred Opp
openaire   +2 more sources

The Spectral Theorem for Bounded Normal Operators

2018
In this chapter we prove the spectral theorem for bounded normal operators T in \(\mathcal{B}(\mathcal{H})\).
Colombo F, Gantner J, Kimsey DP
openaire   +3 more sources

Extreme Value Index Estimation in the Extreme Value Theorem under Non-Linear Normalization

American Journal of Mathematical and Management Sciences, 2023
O M Khaled, H M Barakat
exaly  

THEOREMS ON NORMAL MATRICES

The Quarterly Journal of Mathematics, 1952
openaire   +2 more sources