Traceable Sets

DOI10.1007/978-3-642-15240-5_22MaRDI QIDQ3163891zbMATH OpenOpenAlexFDO

Authors Rupert Hölzl, Wolfgang Merkle

Publication date 27 October 2010

Published in IFIP Advances in Information and Communication Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15240-5_22

zbMATH Keywords

traceability

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• scientific article; zbMATH DE number 3887691
• Unavoidable traces of set systems
• Traces, traceability, and lattices of traces under the set theoretic inclusion
• On non-binary traceability set systems
• A note on traces of set families
• Traces of uniform families of sets
• A sufficient condition on traceable
• Theory of traces
• scientific article; zbMATH DE number 3966121
• A generalization of traces

Cited in

(9)

• Trades and defining sets with applications to access schemes
• Reducibilities relating to Schnorr randomness
• Deep \(\Pi_1^0\) classes
• On effectively closed sets of effective strong measure zero
• Unified characterizations of lowness properties via Kolmogorov complexity
• Schnorr triviality and its equivalent notions
• Randomness for computable measures and initial segment complexity
• Traces, traceability, and lattices of traces under the set theoretic inclusion
• Freshness and Name-Restriction in Sets of Traces with Names

This page was built for publication: Traceable Sets

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