Benedikt Löwe

  • University of Hamburg, Germany
  • University of Amsterdam, The Netherlands (former)

According to our database1, Benedikt Löwe authored at least 63 papers between 1998 and 2022.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Order Types of Models of Fragments of Peano Arithmetic.
Bull. Symb. Log., 2022

Enabling mathematical cultures: introduction.
Synth., 2021

Preface to the special issue in memory of S. Barry Cooper (1943-2015).
Comput., 2018

S. Barry Cooper (1943-2015).
Comput., 2018

A multiplication operation for the hierarchy of norms.
Ann. Pure Appl. Log., 2018

Koepke Machines and Satisfiability for Infinitary Propositional Languages.
Proceedings of the Unveiling Dynamics and Complexity, 2017

Restrictiveness Relative to Notions of Interpretation.
Rev. Symb. Log., 2016

Questions on generalised Baire spaces.
Math. Log. Q., 2016

The Modal Logic of Inner Models.
J. Symb. Log., 2016

Barry Cooper (1943-2015): The engine of Computability in Europe.
Comput., 2016

History and philosophy of infinity - Selected papers from the conference "Foundations of the Formal Sciences VIII" held at Corpus Christi College, Cambridge, England, 20-23 September 2013.
Synth., 2015

Generalized Algebra-Valued Models of Set Theory.
Rev. Symb. Log., 2015

Computability in Europe 2010.
J. Log. Comput., 2015

Annotating with Propp's <i>Morphology of the Folktale</i>: reproducibility and trainability.
Lit. Linguistic Comput., 2014

Planning with epistemic goals (Dagstuhl Seminar 14032).
Dagstuhl Reports, 2014

Turing Centenary Conference: How the World Computes.
Ann. Pure Appl. Log., 2014

What Makes Stories Similar? Report on a Research Project, 2011-2014 (Invited Report).
Proceedings of the 2014 Workshop on Computational Models of Narrative, 2014

Computability in Europe 2009.
J. Log. Comput., 2013

Canonical measure assignments.
J. Symb. Log., 2013

Computability in Europe 2011.
Ann. Pure Appl. Log., 2013

Moving Up and Down in the Generic Multiverse.
Proceedings of the Logic and Its Applications, 5th Indian Conference, 2013

Computational and Cognitive Aspects of Narrative.
Proceedings of the 35th Annual Meeting of the Cognitive Science Society, 2013

Fatal Heyting Algebras and Forcing Persistent Sentences.
Stud Logica, 2012

Programs, Proofs, Processes.
Theory Comput. Syst., 2012

Computability in Europe 2009.
Theory Comput. Syst., 2012

Comput., 2012

Computability in Europe 2010.
Ann. Pure Appl. Log., 2012

Computability in Europe 2009.
Ann. Pure Appl. Log., 2012

The axiom of real Blackwell determinacy.
Arch. Math. Log., 2012

Computational models of narrative structure.
Proceedings of the 7th Annual International Conference of the Alliance of Digital Humanities Organizations, 2012

Data and phenomena in conceptual modelling.
Synth., 2011

Computability in Europe 2008.
Theory Comput. Syst., 2011

The synchronicity of dynamic epistemic logic.
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

DEL Planning and Some Tractable Cases.
Proceedings of the Logic, Rationality, and Interaction - Third International Workshop, 2011

Computability in Europe 2008.
Arch. Math. Log., 2010

Comparing Formal Frameworks of Narrative Structure.
Proceedings of the Computational Models of Narrative, 2010

Theor. Comput. Sci., 2009

Logic and Computation in the Real World: CiE 2007.
J. Log. Comput., 2009

Ann. Pure Appl. Log., 2009

From Gödel to Einstein: Computability between logic and physics at CiE 2006.
Theor. Comput. Sci., 2008

Computability in Europe 2006.
Theory Comput. Syst., 2008

Computing and the natural sciences at CiE 2005.
Theor. Comput. Sci., 2007

Theory of Computation at CiE 2005.
Theory Comput. Syst., 2007

The Extent of Constructive Game Labellings.
J. Log. Comput., 2007

Logical Approaches to Computational Barriers: CiE 2006.
J. Log. Comput., 2007

Belief Flow in Assertion Networks.
Proceedings of the Conceptual Structures: Knowledge Architectures for Smart Applications, 2007

Set Theory With and Without Urelements and Categories of Interpretations.
Notre Dame J. Formal Log., 2006

Mathematics of computing at CiE 2005.
Math. Struct. Comput. Sci., 2006

A parametrised choice principle and Martin's conjecture on Blackwell determinacy.
Math. Log. Q., 2006

Revision Forever!
Proceedings of the Conceptual Structures: Inspiration and Application, 2006

Space Bounds for Infinitary Computation.
Proceedings of the Logical Approaches to Computational Barriers, 2006

Comparing Inductive and Circular Definitions: Parameters, Complexity and Games.
Stud Logica, 2005

A Global Wellordering of Norms Defined via Blackwell Games.
Order, 2005

Cardinal spaces and topological representations of bimodal logics.
Log. J. IGPL, 2005

The Formal Sciences: Their Scope, Their Foundations, and Their Unity.
Synth., 2002

Playing with mixed strategies on infinite sets.
Int. J. Game Theory, 2002

Set-Theoretic Absoluteness and the Revision Theory of Truth.
Stud Logica, 2001

Revision Sequences and Computers with an Infinite Amount of Time.
J. Log. Comput., 2001

Turing cones and set theory of the reals.
Arch. Math. Log., 2001

Complexity hierarchies derived from reduction functions.
Proceedings of the Classical and New Paradigms of Computation and their Complexity Hierarchies, 2001

Cofinalities of Linear Orders.
Order, 1999

Solovay-Type Characterizations for Forcing-Algebras.
J. Symb. Log., 1999

Uniform unfolding and analytic measurability.
Arch. Math. Log., 1998