#### Filter Results:

- Full text PDF available (36)

#### Publication Year

1967

2017

- This year (1)
- Last 5 years (16)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Libor Barto, Jakub Oprsal, Michael Pinsker
- ArXiv
- 2015

A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that pp-interpretations between at most countable ω-categorical relational structures have two algebraic counterparts for their polymorphism clones: a semantic one via the standard algebraic operators H, S, P, and a syntactic one via clone… (More)

- Manuel Bodirsky, Michael Pinsker, Todor Tsankov
- 2011 IEEE 26th Annual Symposium on Logic in…
- 2011

For a fixed infinite structure $\Gamma$ with finite signature tau, we study the following computational problem: input are quantifier-free first-order tau-formulas phi_0,phi_1,...,phi_n that define relations R_0,R_1,\dots,R_n over Gamma. The question is whether the relation R_0 is primitive positive definable from R_1,...,R_n, i.e., definable by a… (More)

- Manuel Bodirsky, Hubie Chen, Michael Pinsker
- J. Symb. Log.
- 2010

We initiate the study of reducts of relational structures up to primitive positive interdefinability: After providing the tools for such a study, we apply these tools in order to obtain a classification of the reducts of the logic of equality. It turns out that there exists a continuum of such reducts. Equivalently, expressed in the language of universal… (More)

- Manuel Bodirsky, Michael Pinsker
- ArXiv
- 2012

One of the most fundamental mathematical contributions of Garrett Birkhoff is the HSP theorem, which implies that a finite algebra B satisfies all equations that hold in a finite algebra A of the same signature if and only if B is a homomorphic image of a subalgebra of a finite power of A. On the other hand, if A is infinite, then in general one needs to… (More)

- Michael Pinsker, Norman V V Carroll
- Anesthesia and analgesia
- 1999

UNLABELLED
We conducted a randomized trial to compare the incidence of vomiting and the quality of emergence from anesthesia associated with the use of remifentanil versus a nonopiate. It was expected that remifentanil would provide smoother emergence from anesthesia with a comparably low rate of vomiting. The study sample consisted of 115 pediatric… (More)

- Manuel Bodirsky, Michael Pinsker
- ArXiv
- 2011

One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the endomorphism monoid, or the polymorphism clone of a structure. Such functions can be particularly well understood when the… (More)

- Libor Barto, Michael Pinsker
- LICS
- 2016

We prove that an ω-categorical core structure primitively positively interprets all finite structures with parameters if and only if some stabilizer of its polymorphism clone has a homomorphism to the clone of projections, and that this happens if and only if its polymorphism clone does not contain operations α, β, s satisfying the identity… (More)

- Michael Pinsker
- 2005

We first determine the maximal clones on a set X of infinite regular cardinality κ which contain all permutations but not all unary functions, extending a result of Heindorf’s for countably infinite X. If κ is countably infinite or weakly compact, this yields a list of all maximal clones containing the permutations since in that case the maximal clones… (More)

- Manuel Bodirsky, Michael Pinsker, András Pongrácz
- ArXiv
- 2013

Function clones are sets of functions on a fixed domain that are closed under composition and contain the projections. They carry a natural algebraic structure, provided by the laws of composition which hold in them, as well as a natural topological structure, provided by the topology of pointwise convergence, under which composition of functions becomes… (More)

- Michael Pinsker
- 2005

We show that on an infinite set, there exist no other precomplete clones closed under conjugation except those which contain all permutations. Since on base sets of some infinite cardinalities, in particular on countably infinite ones, the precomplete clones containing the permutations have been determined, this yields a complete list of the precomplete… (More)