Page 1 Next

Displaying 1 – 20 of 33

Showing per page

Deductive systems of BCK-algebras

Sergio A. Celani (2004)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

In this paper we shall give some results on irreducible deductive systems in BCK-algebras and we shall prove that the set of all deductive systems of a BCK-algebra is a Heyting algebra. As a consequence of this result we shall show that the annihilator F * of a deductive system F is the the pseudocomplement of F . These results are more general than that the similar results given by M. Kondo in [7].

Representations of Reals in Reverse Mathematics

Jeffry L. Hirst (2007)

Bulletin of the Polish Academy of Sciences. Mathematics

Working in the framework of reverse mathematics, we consider representations of reals as rapidly converging Cauchy sequences, decimal expansions, and two sorts of Dedekind cuts. Converting single reals from one representation to another can always be carried out in RCA₀. However, the conversion process is not always uniform. Converting infinite sequences of reals in some representations to other representations requires the use of WKL₀ or ACA₀.

Reverse mathematics of some topics from algorithmic graph theory

Peter Clote, Jeffry Hirst (1998)

Fundamenta Mathematicae

This paper analyzes the proof-theoretic strength of an infinite version of several theorems from algorithmic graph theory. In particular, theorems on reachability matrices, shortest path matrices, topological sorting, and minimal spanning trees are considered.

Currently displaying 1 – 20 of 33

Page 1 Next