Displaying 101 – 120 of 171

Showing per page

Fraïssé structures and a conjecture of Furstenberg

Dana Bartošová, Andy Zucker (2019)

Commentationes Mathematicae Universitatis Carolinae

We study problems concerning the Samuel compactification of the automorphism group of a countable first-order structure. A key motivating question is a problem of Furstenberg and a counter-conjecture by Pestov regarding the difference between S ( G ) , the Samuel compactification, and E ( M ( G ) ) , the enveloping semigroup of the universal minimal flow. We resolve Furstenberg’s problem for several automorphism groups and give a detailed study in the case of G = S , leading us to define and investigate several new types...

Free actions of free groups on countable structures and property (T)

David M. Evans, Todor Tsankov (2016)

Fundamenta Mathematicae

We show that if G is a non-archimedean, Roelcke precompact Polish group, then G has Kazhdan's property (T). Moreover, if G has a smallest open subgroup of finite index, then G has a finite Kazhdan set. Examples of such G include automorphism groups of countable ω-categorical structures, that is, the closed, oligomorphic permutation groups on a countable set. The proof uses work of the second author on the unitary representations of such groups, together with a separation result for infinite permutation...

Free Interpretation, Quotient Interpretation and Substitution of a Letter with a Term for First Order Languages

Marco Caminati (2011)

Formalized Mathematics

Fourth of a series of articles laying down the bases for classical first order model theory. This paper supplies a toolkit of constructions to work with languages and interpretations, and results relating them. The free interpretation of a language, having as a universe the set of terms of the language itself, is defined.The quotient of an interpreteation with respect to an equivalence relation is built, and shown to remain an interpretation when the relation respects it. Both the concepts of quotient...

From computing with numbers to computing with words - From manipulation of measurements to manipulation of perceptions

Lotfi Zadeh (2002)

International Journal of Applied Mathematics and Computer Science

Computing, in its usual sense, is centered on manipulation of numbers and symbols. In contrast, computing with words, or CW for short, is a methodology in which the objects of computation are words and propositions drawn from a natural language, e.g., small, large, far, heavy, not very likely, the price of gas is low and declining, Berkeley is near San Francisco, it is very unlikely that there will be a significant increase in the price of oil in the near future, etc. Computing with words is inspired...

From two- to four-valued logic

Chris Brink (1993)

Banach Center Publications

The purpose of this note is to show that a known and natural four-valued logic co-exists with classical two-valued logic in the familiar context of truth tables. The tool required is the power construction.

From well to better, the space of ideals

Raphaël Carroy, Yann Pequignot (2014)

Fundamenta Mathematicae

On the one hand, the ideals of a well quasi-order (wqo) naturally form a compact topological space into which the wqo embeds. On the other hand, Nash-Williams' barriers are given a uniform structure by embedding them into the Cantor space. We prove that every map from a barrier into a wqo restricts on a barrier to a uniformly continuous map, and therefore extends to a continuous map from a countable closed subset of the Cantor space into the space of ideals of the wqo. We then...

Function operators spanning the arithmetical and the polynomial hierarchy

Armin Hemmerling (2010)

RAIRO - Theoretical Informatics and Applications

A modified version of the classical µ-operator as well as the first value operator and the operator of inverting unary functions, applied in combination with the composition of functions and starting from the primitive recursive functions, generate all arithmetically representable functions. Moreover, the nesting levels of these operators are closely related to the stratification of the arithmetical hierarchy. The same is shown for some further function operators known from computability and complexity theory....

Functional monadic n -valued Łukasiewicz algebras

A. V. Figallo, Claudia A. Sanza, Alicia Ziliani (2005)

Mathematica Bohemica

Some functional representation theorems for monadic n -valued Łukasiewicz algebras (qLk n -algebras, for short) are given. Bearing in mind some of the results established by G. Georgescu and C. Vraciu (Algebre Boole monadice si algebre Łukasiewicz monadice, Studii Cercet. Mat. 23 (1971), 1027–1048) and P. Halmos (Algebraic Logic, Chelsea, New York, 1962), two functional representation theorems for qLk n -algebras are obtained. Besides, rich qLk n -algebras are introduced and characterized. In addition,...

Functions Equivalent to Borel Measurable Ones

Andrzej Komisarski, Henryk Michalewski, Paweł Milewski (2010)

Bulletin of the Polish Academy of Sciences. Mathematics

Let X and Y be two Polish spaces. Functions f,g: X → Y are called equivalent if there exists a bijection φ from X onto itself such that g∘φ = f. Using a theorem of J. Saint Raymond we characterize functions equivalent to Borel measurable ones. This characterization answers a question asked by M. Morayne and C. Ryll-Nardzewski.

Functions of Baire class one

Denny H. Leung, Wee-Kee Tang (2003)

Fundamenta Mathematicae

Let K be a compact metric space. A real-valued function on K is said to be of Baire class one (Baire-1) if it is the pointwise limit of a sequence of continuous functions. We study two well known ordinal indices of Baire-1 functions, the oscillation index β and the convergence index γ. It is shown that these two indices are fully compatible in the following sense: a Baire-1 function f satisfies β ( f ) ω ξ · ω ξ for some countable ordinals ξ₁ and ξ₂ if and only if there exists a sequence (fₙ) of Baire-1 functions...

Currently displaying 101 – 120 of 171