In computability theory a cylindrification is a construction that associates a cylindric numbering to each numbering. The concept was firstâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Ilan Lobel, Renato Paes Leme, Adrian Vladu
- EC
- 2017

We consider a multidimensional search problem that is motivated by questions in contextual decision-making, such as dynamicâ€¦Â (More)

Is this relevant?

2014

2014

- TamÃ¡s Waldhauser
- 2014 IEEE 44th International Symposium onâ€¦
- 2014

We consider classes of operations in multiple-valued logic that are closed under composition as well as under permutation ofâ€¦Â (More)

Is this relevant?

2013

2013

A set of operations on A is shown to be the set of linear term operations of some algebra on A if and only if it is closed underâ€¦Â (More)

Is this relevant?

2011

2011

- TamÃ¡s Waldhauser
- 2011 41st IEEE International Symposium onâ€¦
- 2011

We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization ofâ€¦Â (More)

Is this relevant?

2010

2010

- Miguel Couceiro, Erkko Lehtonen
- 2010 40th IEEE International Symposium onâ€¦
- 2010

We describe the classes of operations closed under permutation of variables, addition of dummy variables and composition in termsâ€¦Â (More)

Is this relevant?

2007

2007

- Robin Hirsch
- J. Log. Comput.
- 2007

A boolean module comprises a relation algebra, a boolean algebra and a Peircean operator which must obey a certain finite set ofâ€¦Â (More)

Is this relevant?

2003

2003

- Robert Demolombe
- Fundam. Inform.
- 2003

Answers to queries in terms of abstract objects are defined in the logical framework of first order predicate calculus. A partialâ€¦Â (More)

Is this relevant?

1993

1993

- Chris Brink, Katarina Britz
- Formal Aspects of Computing
- 1993

We present a two-sorted algebra, called aPeirce algebra, of relations and sets interacting with each other. In a Peirce algebraâ€¦Â (More)

Is this relevant?

1984

1984

- Emanuela Fachini, Margherita Napoli
- Theor. Comput. Sci.
- 1984

In : his paper we consider wordsequence functions, i.e., functions of the type f : ,V*â€™ --, E*â€˜ where Z is a finite alphabet andâ€¦Â (More)

Is this relevant?

1982