The following pages link to Marc Bezem (Q409313):
Displaying 50 items.
- Expressive power of digraph solvability (Q409316) (← links)
- Completeness of resolution revisited (Q914411) (← links)
- Hard problems in max-algebra, control theory, hypergraphs and other areas (Q990130) (← links)
- Exponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebra (Q1003740) (← links)
- Developing bounded reasoning (Q1006510) (← links)
- Equivalence of bar recursors in the theory of functionals of finite type (Q1115867) (← links)
- On estimating the complexity of logarithmic decomposition (Q1116321) (← links)
- Diagram techniques for confluence (Q1271472) (← links)
- Undecidable goals for completed acyclic programs (Q1326578) (← links)
- Formalizing process algebraic verifications in the calculus of constructions (Q1355748) (← links)
- Two finite specifications of a queue (Q1391797) (← links)
- A descriptive characterisation of even linear languages (Q1430213) (← links)
- Syntactic forcing models for coherent logic (Q1788327) (← links)
- Automated proof construction in type theory using resolution (Q1868508) (← links)
- Polymorphic extensions of simple type structures. With an application to a bar recursive minimization (Q1919547) (← links)
- Construction of the circle in \textit{UniMath} (Q2031555) (← links)
- Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism (Q2123048) (← links)
- A Kripke model for simplicial sets (Q2257308) (← links)
- The univalence axiom in cubical sets (Q2319981) (← links)
- On the mechanization of the proof of Hessenberg's theorem in coherent logic (Q2471743) (← links)
- (Q2723415) (← links)
- (Q2968413) (← links)
- (Q3024822) (← links)
- A simple proof of the undecidability of inhabitation in λP (Q3125231) (← links)
- On streams that are finitely red (Q3166225) (← links)
- Ramsey's Theorem and the Pigeonhole Principle in Intuitionistic Mathematics (Q3353014) (← links)
- (Q3395957) (← links)
- (Q3477990) (← links)
- Completeness and Decidability in Sequence Logic (Q3498460) (← links)
- Isomorphisms between HEO and HRO<sup>E</sup>, ECF and ICF<sup>E</sup> (Q3699686) (← links)
- Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals (Q3699687) (← links)
- Strong normalization of barrecursive terms without using infinite terms (Q3739119) (← links)
- (Q3807643) (← links)
- (Q3811747) (← links)
- Compact and majorizable functionals of finite type (Q3822153) (← links)
- (Q3983042) (← links)
- Semantics and Consistency of Rule based Expert Systems (Q3985546) (← links)
- Strong termination of logic programs (Q4036282) (← links)
- On the computational content of the axiom of choice (Q4212925) (← links)
- Improving IntSat by expressing disjunctions of bounds as linear constraints (Q4589125) (← links)
- (Q4665735) (← links)
- (Q4702566) (← links)
- (Q4783309) (← links)
- On generalized algebraic theories and categories with families (Q5084311) (← links)
- Skolem’s Theorem in Coherent Logic (Q5212032) (← links)
- (Q5224684) (← links)
- (Q5277833) (← links)
- Automating Coherent Logic (Q5387843) (← links)
- A Vernacular for Coherent Logic (Q5495937) (← links)
- The Max-Atom Problem and Its Relevance (Q5505542) (← links)
