Nonstandard methods in combinatorics and theoretical computer science

DOI10.1007/BF00370549zbMath0669.03040MaRDI QIDQ1118589

Michael M. Richter, Manfred E. Szabo

Publication date: 1989

Published in: Studia Logica (Search for Journal in Brave)

zbMATH Keywords

surveymonadstheory of computationnon-standard methodsinternal set theory

Mathematics Subject Classification ID

Theory of computing (68Q99) Nonstandard models (03H99)

Related Items (1)

Output concepts for accelerated Turing machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Foundations of infinitesimal stochastic analysis
• Eine Erweiterung der Infinitesimalrechnung
• "On the plausibility of nonstandard proofs in analysis"
• Monadic Properties of Uniformities
• The strength of nonstandard methods in arithmetic
• On the strength of nonstandard analysis
• Internal set theory: A new approach to nonstandard analysis

This page was built for publication: Nonstandard methods in combinatorics and theoretical computer science