Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Back to Simple Search

Advanced Search

Match of the following rules

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

Currently displaying 1 – 2 of 2

Order by Relevance | Title | Year of publication

Complexity of the decidability of the unquantified set theory with a rank operator.

Tetruashvili, M. — 1994

Georgian Mathematical Journal

Complexity of the decidability of one class of formulas in quantifier-free set theory with a set-union operator.

Tetruashvili, M. — 1996

Georgian Mathematical Journal

Page 1

Download Results (CSV)