Displaying 461 – 480 of 5989

Showing per page

Abstract Reduction Systems and Idea of Knuth-Bendix Completion Algorithm

Grzegorz Bancerek (2014)

Formalized Mathematics

Educational content for abstract reduction systems concerning reduction, convertibility, normal forms, divergence and convergence, Church- Rosser property, term rewriting systems, and the idea of the Knuth-Bendix Completion Algorithm. The theory is based on [1].

Abstract β -expansions and ultimately periodic representations

Michel Rigo, Wolfgang Steiner (2005)

Journal de Théorie des Nombres de Bordeaux

For abstract numeration systems built on exponential regular languages (including those coming from substitutions), we show that the set of real numbers having an ultimately periodic representation is ( β ) if the dominating eigenvalue β > 1 of the automaton accepting the language is a Pisot number. Moreover, if β is neither a Pisot nor a Salem number, then there exist points in ( β ) which do not have any ultimately periodic representation.

Adding a lot of Cohen reals by adding a few. II

Moti Gitik, Mohammad Golshani (2015)

Fundamenta Mathematicae

We study pairs (V, V₁), V ⊆ V₁, of models of ZFC such that adding κ-many Cohen reals over V₁ adds λ-many Cohen reals over V for some λ > κ.

Currently displaying 461 – 480 of 5989