Monika Seisenberger – författare

Visar alla böcker från författaren Monika Seisenberger. Handla med fri frakt och snabb leverans.

5 produkter

Kategorier

5 produkter

Del 53 - Trends in Logic
Well-Quasi Orders in Computation, Logic, Language and Reasoning
A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory
AvPeter M. Schuster,Monika Seisenbergerm. fl.
Inbunden, Engelska, 2020
1 998 kr
Skickas inom 10-15 vardagar
This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science. The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students.
Well-Quasi Orders in Computation, Logic, Language and Reasoning
A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory
AvAndreas Weiermann,Monika Seisenbergerm. fl.
E-bok
Engelska, 2020
2 543 kr
Läs direkt efter köp
This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science.
The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students.
Del 53 - Trends in Logic
Well-Quasi Orders in Computation, Logic, Language and Reasoning
A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory
AvPeter M. Schuster,Monika Seisenbergerm. fl.
Häftad, Engelska, 2021
1 998 kr
Skickas inom 10-15 vardagar
This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science. The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students.
Logic, Construction, Computation
AvUlrich Berger,Hannes Dienerm. fl.
Inbunden, Engelska, 2012
3 060 kr
Skickas inom 5-8 vardagar
Over the last few decades the interest of logicians and mathematicians in constructive and computational aspects of their subjects has been steadily growing, and researchers from disparate areas realized that they can benefit enormously from the mutual exchange of techniques concerned with those aspects. A key figure in this exciting development is the logician and mathematician Helmut Schwichtenberg to whom this volume is dedicated on the occasion of his 70th birthday and his turning emeritus. The volume contains 20 articles from leading experts about recent developments in Constructive set theory, Provably recursive functions, Program extraction, Theories of truth, Constructive mathematics, Classical vs. intuitionistic logic, Inductive definitions, and Continuous functionals and domains.
Logic, Construction, Computation
AvMonika Seisenberger,Peter Schusterm. fl.
E-bok
PDF, Engelska, 2013
3 072 kr
Läs direkt efter köp

Over the last few decades the interest of logicians and mathematicians in constructive and computational aspects of their subjects has been steadily growing, and researchers from disparate areas realized that they can benefit enormously from the mutual exchange of techniques concerned with those aspects. A key figure in this exciting development is the logician and mathematician Helmut Schwichtenberg to whom this volume is dedicated on the occasion of his 70th birthday and his turning emeritus. The volume contains 20 articles from leading experts about recent developments in Constructive set theory, Provably recursive functions, Program extraction, Theories of truth, Constructive mathematics, Classical vs. intuitionistic logic, Inductive definitions, and Continuous functionals and domains.

Företag, bibliotek eller offentlig verksamhet?

Monika Seisenberger – författare

Well-Quasi Orders in Computation, Logic, Language and Reasoning

Well-Quasi Orders in Computation, Logic, Language and Reasoning

Well-Quasi Orders in Computation, Logic, Language and Reasoning

Logic, Construction, Computation

Logic, Construction, Computation

Mina sidor

Mina sidor

Hjälp

Hjälp

Om Bokus

Om Bokus

Populärt

Populärt

Inspiration

Inspiration