Computing with Infinite Terms and Infinite Reductions

DOI10.3233/FI-2019-1866MaRDI QIDQ5208870zbMATH OpenOpenAlexFDO

Authors Jeroen Ketema, Jakob Grue Simonsen

Publication date 22 January 2020

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2019-1866

zbMATH Keywords

computabilitydescendantsinfinitary term rewritingneeded reductionsorigins

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Reasoning about infinite computations
• Infinite computations and the generic finite
• Infinite terms and infinite rewritings
• Computing with infinitary logic
• Wadge reducibility and infinite computations
• Computations with grossone-based infinities
• Infinity Computer and Calculus
• Infinite computations with random oracles
• Infinitary combinatory reduction systems
• Term Rewriting and Applications

Cited in

(11)

• Wadge reducibility and infinite computations
• Reasoning about infinite computations
• Projections for infinitary rewriting
• Descendants and origins in term rewriting.
• Infinitary rewriting: closure operators, equivalences and models
• Projections for infinitary rewriting (extended version)
• Infinite computations and the generic finite
• scientific article; zbMATH DE number 952103 (Why is no real title available?)
• Term rewriting characterisation of LOGSPACE for finite and infinite data
• Reinterpreting compression in infinitary rewriting
• Infinitary rewriting: foundations revisited

This page was built for publication: Computing with Infinite Terms and Infinite Reductions

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