Cylindrification

In computability theory a cylindrification is a construction that associates a cylindric numbering to each numbering. The concept was first… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1969-2017
01219692017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We consider a multidimensional search problem that is motivated by questions in contextual decision-making, such as dynamic… (More)
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2014
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)
  • table 1
Is this relevant?
2011
2011
We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 3
Is this relevant?
2010
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
A boolean module comprises a relation algebra, a boolean algebra and a Peircean operator which must obey a certain finite set of… (More)
  • figure 1
Is this relevant?
2003
2003
Answers to queries in terms of abstract objects are defined in the logical framework of first order predicate calculus. A partial… (More)
  • table 1
  • figure 1
Is this relevant?
1993
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
In : his paper we consider wordsequence functions, i.e., functions of the type f : ,V*’ --, E*‘ where Z is a finite alphabet and… (More)
  • figure I
Is this relevant?