Decidability Mathematical Logic

34 books
Gödel's proofErnest Nagel
⏱ 1h 58m

Gödel's proof

Ernest Nagel

1958118 pp.
Deducibility and DecidabilityR. R. Rockingham Gill
⏱ 2h 50m

Deducibility and Decidability

R. R. Rockingham Gill

1990170 pp.
Classical Decision ProblemEgon Börger
⏱ 8h 12m

Classical Decision Problem

Egon Börger

1997492 pp.
The classical decision problemEgon Boerger
⏱ 8h 12m

The classical decision problem

Egon Boerger

1997492 pp.
The classical decision problemE. Börger
⏱ 8h 2m

The classical decision problem

E. Börger

1997482 pp.
Reachability ProblemsParosh Aziz Abdulla
⏱ 3h 43m

Reachability Problems

Parosh Aziz Abdulla

2010223 pp.
Thinking about ActingJohn L. Pollock

Thinking about Acting

John L. Pollock

2006No page data
The undecidability of the domino problemRobert Berger
⏱ 1h 12m

The undecidability of the domino problem

Robert Berger

196472 pp.
Issues of decidability and tractabilityWitold Marciszewski
⏱ 3h 47m

Issues of decidability and tractability

Witold Marciszewski

2006227 pp.
Countable Boolean algebras and decidabilityS. S. Goncharov
⏱ 5h 18m

Countable Boolean algebras and decidability

S. S. Goncharov

1997318 pp.
New Essays On The Philosophy Of Michael Dummett.(Grazer Philosophische Studien 55)Peter Sullivan
⏱ 4h 23m

New Essays On The Philosophy Of Michael Dummett.(Grazer Philosophische Studien 55)

Peter Sullivan

1998263 pp.
Decidability and generalized quantifiersUnknown Author
⏱ 3h 55m

Decidability and generalized quantifiers

Unknown Author

1980235 pp.
Decision problems for equational theories of relation algebrasH. Andréka
⏱ 2h 6m

Decision problems for equational theories of relation algebras

H. Andréka

1997126 pp.
Decision problems for equational theories of relation algebrasH. Andréka
⏱ 2h 6m

Decision problems for equational theories of relation algebras

H. Andréka

1997126 pp.
Schetnye bulevy algebry i razreshimostʹS. S. Goncharov
⏱ 6h 1m

Schetnye bulevy algebry i razreshimostʹ

S. S. Goncharov

1996361 pp.
Logically motivated varieties with decidable finite algebrasPaweł Idziak
⏱ 1h 9m

Logically motivated varieties with decidable finite algebras

Paweł Idziak

198969 pp.
Cornerstones of undecidabilityGrzegorz Rozenberg
⏱ 3h 17m

Cornerstones of undecidability

Grzegorz Rozenberg

1994197 pp.
Reachability ProblemsOlivier Bournez

Reachability Problems

Olivier Bournez

2009No page data
Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model TheoremDenis R. Hirschfeldt

Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem

Denis R. Hirschfeldt

2017No page data
Metody refutacyjne w badaniach nad systemami logicznymiRobert Sochacki
⏱ 2h 1m

Metody refutacyjne w badaniach nad systemami logicznymi

Robert Sochacki

2010121 pp.
Page 1 of 2Next →