Trends in Logic - Well-Quasi Orders in Computation, Logic, Language and Reasoning
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 13)

H-INDEX

(FIVE YEARS 1)

Published By Springer International Publishing

9783030302283, 9783030302290

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Well-Quasi Orders and Hierarchy Theory

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

10.1007/978-3-030-30229-0_10 ◽

2020 ◽

pp. 271-319 ◽

Cited By ~ 1

Author(s):

Victor Selivanov

Keyword(s):

Hierarchy Theory

Download Full-text

On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders

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

10.1007/978-3-030-30229-0_2 ◽

2020 ◽

pp. 29-54

Author(s):

Mirna Džamonja ◽

Sylvain Schmitz ◽

Philippe Schnoebelen

Download Full-text

Well Quasi-orderings and Roots of Polynomials in a Hahn Field

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

10.1007/978-3-030-30229-0_5 ◽

2020 ◽

pp. 127-144

Author(s):

Julia F. Knight ◽

Karen Lange

Keyword(s):

Roots Of Polynomials

Download Full-text

Strong WQO Tree Theorems

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

10.1007/978-3-030-30229-0_4 ◽

2020 ◽

pp. 107-125

Author(s):

Lev Gordeev

Download Full-text

Well-Partial Orderings and their Maximal Order Types

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

10.1007/978-3-030-30229-0_13 ◽

2020 ◽

pp. 351-391

Author(s):

Diana Schmidt

Keyword(s):

Maximal Order ◽

Order Types ◽

Partial Orderings

Download Full-text

A Combinatorial Bound for a Restricted Form of the Termination Theorem

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

10.1007/978-3-030-30229-0_11 ◽

2020 ◽

pp. 321-338

Author(s):

Silvia Steila

Keyword(s):

Restricted Form

Download Full-text

Well Quasi-orders and the Functional Interpretation

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

10.1007/978-3-030-30229-0_9 ◽

2020 ◽

pp. 221-269 ◽

Cited By ~ 1

Author(s):

Thomas Powell

Keyword(s):

Functional Interpretation

Download Full-text

A Mechanized Proof of Higman’s Lemma by Open Induction

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

10.1007/978-3-030-30229-0_12 ◽

2020 ◽

pp. 339-350 ◽

Cited By ~ 1

Author(s):

Christian Sternagel

Keyword(s):

Open Induction ◽

Higman's Lemma ◽

Higman’S Lemma

Download Full-text

The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings

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

10.1007/978-3-030-30229-0_3 ◽

2020 ◽

pp. 55-105

Author(s):

Jean Goubault-Larrecq ◽

Simon Halfon ◽

Prateek Karandikar ◽

K. Narayan Kumar ◽

Philippe Schnoebelen

Keyword(s):

Ideal Approach ◽

The Ideal

Download Full-text

Well, Better and In-Between

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

10.1007/978-3-030-30229-0_1 ◽

2020 ◽

pp. 1-27

Author(s):

Raphaël Carroy ◽

Yann Pequignot

Download Full-text

Trends in Logic - Well-Quasi Orders in Computation, Logic, Language and ReasoningLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Well-Quasi Orders and Hierarchy Theory

On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders

Well Quasi-orderings and Roots of Polynomials in a Hahn Field

Strong WQO Tree Theorems

Well-Partial Orderings and their Maximal Order Types

A Combinatorial Bound for a Restricted Form of the Termination Theorem

Well Quasi-orders and the Functional Interpretation

A Mechanized Proof of Higman’s Lemma by Open Induction

The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings

Well, Better and In-Between

Trends in Logic - Well-Quasi Orders in Computation, Logic, Language and Reasoning
Latest Publications