Marc Bezem

From MaRDI portal
Person:409313

Available identifiers

zbMath Open bezem.marcDBLP52/961WikidataQ102216580 ScholiaQ102216580MaRDI QIDQ409313

List of research outcomes





PublicationDate of PublicationType
Type theory with explicit universe polymorphism2024-11-26Paper
On generalized algebraic theories and categories with families2022-06-24Paper
Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism2022-04-07Paper
Construction of the circle in \textit{UniMath}2021-06-09Paper
A Note on Generalized Algebraic Theories and Categories with Families2020-12-15Paper
Skolem’s Theorem in Coherent Logic2020-01-24Paper
Construction of the Circle in UniMath2019-10-04Paper
The univalence axiom in cubical sets2019-08-21Paper
https://portal.mardi4nfdi.de/entity/Q52246842019-07-24Paper
Syntactic forcing models for coherent logic2018-10-08Paper
Improving IntSat by expressing disjunctions of bounds as linear constraints2017-11-07Paper
https://portal.mardi4nfdi.de/entity/Q52778332017-07-12Paper
https://portal.mardi4nfdi.de/entity/Q29684132017-03-13Paper
A Kripke model for simplicial sets2015-02-24Paper
A Vernacular for Coherent Logic2014-08-07Paper
On streams that are finitely red2012-10-22Paper
Expressive power of digraph solvability2012-04-13Paper
Hard problems in max-algebra, control theory, hypergraphs and other areas2010-09-02Paper
https://portal.mardi4nfdi.de/entity/Q33959572009-09-15Paper
Developing bounded reasoning2009-03-24Paper
Exponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebra2009-03-04Paper
The Max-Atom Problem and Its Relevance2009-01-27Paper
Automating Coherent Logic2008-05-27Paper
Completeness and Decidability in Sequence Logic2008-05-15Paper
On the mechanization of the proof of Hessenberg's theorem in coherent logic2008-02-18Paper
Processes, Terms and Cycles: Steps on the Road to Infinity2006-11-13Paper
https://portal.mardi4nfdi.de/entity/Q30248222005-07-04Paper
https://portal.mardi4nfdi.de/entity/Q46657352005-04-11Paper
A descriptive characterisation of even linear languages2004-05-27Paper
Automated proof construction in type theory using resolution2003-04-27Paper
https://portal.mardi4nfdi.de/entity/Q47833092002-12-04Paper
https://portal.mardi4nfdi.de/entity/Q27234152001-07-05Paper
https://portal.mardi4nfdi.de/entity/Q47025662000-04-09Paper
On the computational content of the axiom of choice1999-06-21Paper
Diagram techniques for confluence1998-11-10Paper
Two finite specifications of a queue1998-07-23Paper
Formalizing process algebraic verifications in the calculus of constructions1997-08-17Paper
Polymorphic extensions of simple type structures. With an application to a bar recursive minimization1997-05-28Paper
A simple proof of the undecidability of inhabitation in λP1997-03-18Paper
Undecidable goals for completed acyclic programs1995-01-12Paper
Strong termination of logic programs1993-05-16Paper
Ramsey's Theorem and the Pigeonhole Principle in Intuitionistic Mathematics1993-01-01Paper
Semantics and Consistency of Rule based Expert Systems1992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39830421992-06-26Paper
Completeness of resolution revisited1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34779901990-01-01Paper
Compact and majorizable functionals of finite type1989-01-01Paper
Equivalence of bar recursors in the theory of functionals of finite type1988-01-01Paper
On estimating the complexity of logarithmic decomposition1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38117471988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38076431988-01-01Paper
Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals1985-01-01Paper
Isomorphisms between HEO and HROE, ECF and ICFE1985-01-01Paper
Strong normalization of barrecursive terms without using infinite terms1985-01-01Paper

Research outcomes over time

This page was built for person: Marc Bezem