Cylindrification

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

Papers overview

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

2018

Confluence is a decidable property of ground rewrite systems. We present a formalization effort in Isabelle/HOL of the decision…

2009

We describe the classes of operations closed under permutation of variables, addition of dummy variables and composition in terms…

2007

A boolean module comprises a relation algebra, a boolean algebra and a Peircean operator which must obey a certain finite set of…

2003

Answers to queries in terms of abstract objects are defined in the logical framework of first order predicate calculus. A partial…

2002

This paper is concerned with the type analysis of logic programs where, by type, we mean a property closed under instantiation…

1998

In this paper we consider the three-valued logic used by Kleene [6] in the theory of partial recursive functions. This logic has…

1993

We present a two-sorted algebra, called aPeirce algebra, of relations and sets interacting with each other. In a Peirce algebra…

1992

Electronic and mechanical properties of axially extended, hollow, graphitic cylinders grown in static electric field from…

1983

Abstract A many-one degree is functional if it contains the index set of some class of partial recursive functions but does not…

1969

An elementary theory T in a language L is (strongly) finitely inseparable if the set of logically valid sentences of L and the…