EuDML | Browse

In the field of automatic proving, the study of the sets of prime implicants or implicates of a formula has proven to be very important. If we focus on non-classical logics and, in particular, on temporal logics, such study is useful even if it is restricted to the set of unitary implicants/implicates [P. Cordero, M. Enciso, and I. de Guzmán: Structure theorems for closed sets of implicates/implicants in temporal logic. (Lecture Notes in Artificial Intelligence 1695.) Springer–Verlag, Berlin 1999]....

Restrictions on the degree spectra of algebraic structures.

Kalimullin, I.Sh. (2008)

Sibirskij Matematicheskij Zhurnal

Results on automorphisms of recursively saturated models of PA

Roman Kossak, Henryk Kotlarski (1988)

Fundamenta Mathematicae

Retraceable homogeneous sets

T. McLaughlin (1979)

Fundamenta Mathematicae

Reversals-space-parallelism tradeoffs for language recognition

Juraj Hromkovič (1991)

Mathematica Slovaca

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.

Displaying 21 – 34 of 34

Currently displaying 21 – 34 of 34