On the strength of König's duality theorem for countable bipartite graphs (Q4292597): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3797180 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Injective choice functions for countable families / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Patras Logic Symposion. Proceedings of the Logic Symposion held at Patras, Greece, August 18--22, 1980 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Borel quasi-orderings in subsystems of second-order arithmetic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the strength of König's duality theorem for infinite bipartite graphs / rank | |||
Normal rank |
Latest revision as of 16:01, 22 May 2024
scientific article; zbMATH DE number 569556
Language | Label | Description | Also known as |
---|---|---|---|
English | On the strength of König's duality theorem for countable bipartite graphs |
scientific article; zbMATH DE number 569556 |
Statements
On the strength of König's duality theorem for countable bipartite graphs (English)
0 references
3 November 1994
0 references
reverse mathematics
0 references
countably infinite bipartite graph
0 references
vertex covering
0 references
matching
0 references
subsystem of second-order arithmetic
0 references
recursive comprehension
0 references
0 references