Flum, Jörg
Overview
Works:  26 works in 225 publications in 4 languages and 5,426 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Other, Director 
Classifications:  QA9, 511.3 
Publication Timeline
.
Most widely held works by
Jörg Flum
Mathematical logic by
HeinzDieter Ebbinghaus(
Book
)
38 editions published between 1974 and 2008 in 3 languages and held by 817 WorldCat member libraries worldwide
This junior/senior level text is devoted to a study of firstorder logic and its role in the foundations of mathematics: What is a proof? How can a proof be justified? To what extent can a proof be made a purely mechanical procedure? How much faith can we have in a proof that is so complex that no one can follow it through in a lifetime? The first substantial answers to these questions have only been obtained in this century. The most striking results are contained in Goedel's work: First, it is possible to give a simple set of rules that suffice to carry out all mathematical proofs; but, second, these rules are necessarily incomplete  it is impossible, for example, to prove all true statements of arithmetic. The book begins with an introduction to firstorder logic, Goedel's theorem, and model theory. A second part covers extensions of firstorder logic and limitations of the formal methods. The book covers several advanced topics, not commonly treated in introductory texts, such as Trachtenbrot's undecidability theorem. Fraissé's elementary equivalence, and Lindstroem's theorem on the maximality of firstorder logic
38 editions published between 1974 and 2008 in 3 languages and held by 817 WorldCat member libraries worldwide
This junior/senior level text is devoted to a study of firstorder logic and its role in the foundations of mathematics: What is a proof? How can a proof be justified? To what extent can a proof be made a purely mechanical procedure? How much faith can we have in a proof that is so complex that no one can follow it through in a lifetime? The first substantial answers to these questions have only been obtained in this century. The most striking results are contained in Goedel's work: First, it is possible to give a simple set of rules that suffice to carry out all mathematical proofs; but, second, these rules are necessarily incomplete  it is impossible, for example, to prove all true statements of arithmetic. The book begins with an introduction to firstorder logic, Goedel's theorem, and model theory. A second part covers extensions of firstorder logic and limitations of the formal methods. The book covers several advanced topics, not commonly treated in introductory texts, such as Trachtenbrot's undecidability theorem. Fraissé's elementary equivalence, and Lindstroem's theorem on the maximality of firstorder logic
Finite model theory by
HeinzDieter Ebbinghaus(
Book
)
47 editions published between 1995 and 2006 in 3 languages and held by 565 WorldCat member libraries worldwide
The book presents the main results of descriptive complexity theory, that is, the connections between axiomatizability of classes of finite structures and their complexity with respect to time and space bounds. The logics that are important in this context include fixedpoint logics, transitive closure logics, and also certain infinitary languages; their model theory is studied in full detail. Other topics include DATALOG languages, quantifiers and oracles, 01 laws, and optimization and approximation problems. The book is written in such a way that the respective parts on model theory and descriptive complexity theory may be read independently. This second edition is a thoroughly revised and enlarged version of the original text
47 editions published between 1995 and 2006 in 3 languages and held by 565 WorldCat member libraries worldwide
The book presents the main results of descriptive complexity theory, that is, the connections between axiomatizability of classes of finite structures and their complexity with respect to time and space bounds. The logics that are important in this context include fixedpoint logics, transitive closure logics, and also certain infinitary languages; their model theory is studied in full detail. Other topics include DATALOG languages, quantifiers and oracles, 01 laws, and optimization and approximation problems. The book is written in such a way that the respective parts on model theory and descriptive complexity theory may be read independently. This second edition is a thoroughly revised and enlarged version of the original text
Topological model theory by
Jörg Flum(
Book
)
18 editions published in 1980 in 3 languages and held by 414 WorldCat member libraries worldwide
18 editions published in 1980 in 3 languages and held by 414 WorldCat member libraries worldwide
Einführung in die mathematische Logik by
HeinzDieter Ebbinghaus(
Book
)
32 editions published between 1978 and 2007 in German and held by 354 WorldCat member libraries worldwide
Theory of Computation  Mathematical Logic and Formal Languages
32 editions published between 1978 and 2007 in German and held by 354 WorldCat member libraries worldwide
Theory of Computation  Mathematical Logic and Formal Languages
Computer science logic : 13th international workshop, CSL'99 : 8th annual conference of the EACSL, Madrid, Spain, September
2025, 1999 : proceedings by
Jörg Flum(
Book
)
28 editions published in 1999 in English and Undetermined and held by 278 WorldCat member libraries worldwide
This book constitutes the strictly refereed postworkshop proceedings of the 12th International Workshop on Computer Science Logic, CSL '98, held as the Annual Conference of the European Association on Computer Science Logic in Brno, Czech Republic in August 1998. The 25 revised full papers presented were carefully reviewed and selected during two rounds of reviewing and revision. Also included are three reviewed invited papers. The papers span the whole scope of computer science logic and mathematical foundations and represent the state of the art in the area
28 editions published in 1999 in English and Undetermined and held by 278 WorldCat member libraries worldwide
This book constitutes the strictly refereed postworkshop proceedings of the 12th International Workshop on Computer Science Logic, CSL '98, held as the Annual Conference of the European Association on Computer Science Logic in Brno, Czech Republic in August 1998. The 25 revised full papers presented were carefully reviewed and selected during two rounds of reviewing and revision. Also included are three reviewed invited papers. The papers span the whole scope of computer science logic and mathematical foundations and represent the state of the art in the area
Parameterized complexity theory by
Jörg Flum(
Book
)
24 editions published between 2006 and 2011 in English and German and held by 230 WorldCat member libraries worldwide
"Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixedparameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability." "This book is a stateoftheart introduction into both algorithmic techniques for fixedparameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters each are devoted to intractability, algorithmic techniques for designing fixedparameter tractable algorithms, and bounded fixedparameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic." "The book will be of interest to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity."Jacket
24 editions published between 2006 and 2011 in English and German and held by 230 WorldCat member libraries worldwide
"Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixedparameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability." "This book is a stateoftheart introduction into both algorithmic techniques for fixedparameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters each are devoted to intractability, algorithmic techniques for designing fixedparameter tractable algorithms, and bounded fixedparameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic." "The book will be of interest to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity."Jacket
Logic and automata : history and perspectives by
Jörg Flum(
Book
)
16 editions published between 2007 and 2008 in English and Undetermined and held by 95 WorldCat member libraries worldwide
Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of Logic and Automata take the occasion of the sixtieth birthday of Wolfgang Thomas to present a tour d'horizon of automata theory and logic. The twenty papers in this volume cover many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, and semigroup theory, as well as discussing current challenges in the field
16 editions published between 2007 and 2008 in English and Undetermined and held by 95 WorldCat member libraries worldwide
Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of Logic and Automata take the occasion of the sixtieth birthday of Wolfgang Thomas to present a tour d'horizon of automata theory and logic. The twenty papers in this volume cover many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, and semigroup theory, as well as discussing current challenges in the field
Parameterized complexity theory(
)
1 edition published in 2006 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 2006 in English and held by 4 WorldCat member libraries worldwide
Bounded fixed parameter tractability and log2 n nondeterministic bits by
Jörg Flum(
Book
)
2 editions published in 2004 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 2004 in English and held by 4 WorldCat member libraries worldwide
Model checking problems as a basis for parameterized intractability by
Jörg Flum(
Book
)
1 edition published in 2003 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 2003 in English and held by 3 WorldCat member libraries worldwide
Ganzgeschlossene und prädikatengeschlossene Logiken by
Jörg Flum(
Book
)
1 edition published in 1969 in German and held by 3 WorldCat member libraries worldwide
1 edition published in 1969 in German and held by 3 WorldCat member libraries worldwide
Hanf numbers and wellordering numbers by
Jörg Flum(
Book
)
2 editions published in 1972 in German and held by 3 WorldCat member libraries worldwide
2 editions published in 1972 in German and held by 3 WorldCat member libraries worldwide
Computer science logic : 13th international workshop, CSL '99 : 8th annual conference of the EACSL, Madrid, Spain, September
2025, 1999 : procedings by Workshop on Computer Science Logic(
Book
)
1 edition published in 1999 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1999 in English and held by 2 WorldCat member libraries worldwide
Endliche Modelltheorie : 27.3. bis 2.4.1994(
Book
)
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
Lt  Equivalencia by
Juan Carlos Martínez Alonso(
Book
)
2 editions published between 1983 and 1984 in Spanish and held by 2 WorldCat member libraries worldwide
2 editions published between 1983 and 1984 in Spanish and held by 2 WorldCat member libraries worldwide
Analisis no standard by
Jörg Flum(
Book
)
1 edition published in 1976 in English and held by 1 WorldCat member library worldwide
1 edition published in 1976 in English and held by 1 WorldCat member library worldwide
El problema de las palabras en la teoría de grupos by
Jörg Flum(
Book
)
1 edition published in 1976 in Spanish and held by 1 WorldCat member library worldwide
1 edition published in 1976 in Spanish and held by 1 WorldCat member library worldwide
Games and partial datalog queries by
Jörg Flum(
Book
)
1 edition published in 1997 in English and held by 1 WorldCat member library worldwide
1 edition published in 1997 in English and held by 1 WorldCat member library worldwide
Fixedparameter tractability and logic by
Jörg Flum(
Book
)
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
Algebra y lógica by
Jörg Flum(
Book
)
1 edition published in 1976 in Spanish and held by 1 WorldCat member library worldwide
1 edition published in 1976 in Spanish and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Associated Subjects
Algorithms Artificial intelligence Computational complexity Computer logic Computer science Computer scienceMathematics Computer software Game theory Information theory Logic, Symbolic and mathematical Logic design Machine theory Mathematics Model theory Predicate calculus Topological spaces Topology