On effective linearly ordered sets of comparison functions

DOI10.1007/BF02676411zbMATH Open0955.03051MaRDI QIDQ1585633FDOQ1585633

Authors: S. Shkarin 

Publication date: 16 November 2000

Published in: Mathematical Notes (Search for Journal in Brave)

Recommendations

• Ranking functions and axioms for linear orders
• Linear extensions and comparable pairs in partial orders
• Subset Comparisons for Additive Linear Orders
• Comparable linear contractions in ordered metric spaces
• A note on the expressive power of linear orders
• Effective separability of positive and negative linear orders
• On Ehrenfeucht-Fraïssé equivalence of linear orderings
• Computable choice functions for computable linear orderings
• scientific article; zbMATH DE number 4080770
• Necessary Conditions for the Comparison of Sequences of Linear Functionals

zbMATH Keywords

comparison functionsentire functioncontinuum hypothesisZFCfirst category setnatural partial ordersdense comparison class

Mathematics Subject Classification ID

Entire and meromorphic functions of one complex variable, and related topics (30D99) Consistency and independence results (03E35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• ON SOME QUESTIONS IN THE THEORY OF ENTIRE FUNCTIONS
• Title not available (Why is that?)

Cited In (3)

• A complete description of comparison meaningful functions
• Optimal bounds for ordinal comparison maps
• Cuts of linear orders

This page was built for publication: On effective linearly ordered sets of comparison functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1585633)