Matt Kaufmann

From MaRDI portal
Person:230814

Available identifiers

zbMath Open kaufmann.mattWikidataQ6788881 ScholiaQ6788881MaRDI QIDQ230814

List of research outcomes

PublicationDate of PublicationType
Limited second-order functionality in a first-order setting2020-03-03Paper
Iterated ultrapowers for the masses2018-08-16Paper
A mechanically checked proof of the AMD5/sub K/86/sup TM/ floating-point division program2018-07-09Paper
Largest initial segments pointwise fixed by automorphisms of models of set theory2018-02-09Paper
Efficient, verified checking of propositional proofs2018-01-04Paper
Efficient certified RAT verification2017-09-22Paper
Rough Diamond: An Extension of Equivalence-Based Rewriting2014-09-08Paper
A Parallelized Theorem Prover for a Logic with Parallel Execution2013-08-07Paper
The right tools for the job: correctness of cone of influence reduction proved using ACL2 and HOL42011-06-03Paper
Integrating external deduction tools with ACL22009-03-25Paper
An ACL2 Tutorial2008-12-04Paper
Proof Pearl: Wellfounded Induction on the Ordinals Up to ε 02008-09-02Paper
Rewriting with equivalence relations in ACL22008-06-11Paper
Efficient execution in an automated reasoning environment2008-01-18Paper
Meta Reasoning in ACL22006-07-06Paper
https://portal.mardi4nfdi.de/entity/Q30219142005-06-21Paper
https://portal.mardi4nfdi.de/entity/Q48172112004-09-22Paper
Nonstandard analysis in ACL22002-02-19Paper
Structured theory development for a mechanized logic2001-02-18Paper
Verification of Year 2000 conversion rules using the ACL2 theorem prover2000-01-01Paper
Interaction with the Boyer-Moore theorem prover: A tutorial study using the arithmetic-geometric mean theorem1996-06-11Paper
An extension of the Boyer-Moore theorem prover to support first-order quantification1994-01-04Paper
https://portal.mardi4nfdi.de/entity/Q40165401993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40128771992-09-27Paper
Generalization in the presence of free variables: A mechanically-checked correctness proof for one algorithm1991-01-01Paper
Remarks on weak notions of saturation in models of Peano arithmetic1987-01-01Paper
The Hanf number of stationary logic1986-01-01Paper
On random models of finite power and monadic logic1985-01-01Paper
A note on the Hanf number of second-order logic1985-01-01Paper
Some remarks on equivalence in infinitary and stationary logic1984-01-01Paper
A nonconservativity result on global choice1984-01-01Paper
Saturation and simple extensions of models of Peano arithmetic1984-01-01Paper
On expandability of models of arithmetic and set theory to models of weak second-order theories1984-01-01Paper
DEFINABLE ULTRAPOWERS AND ULTRAFILTERS OVER ADMISSIBLE ORDINALS1984-01-01Paper
Mutually generic classes and incompatible expansions1984-01-01Paper
The strength of nonstandard methods in arithmetic1984-01-01Paper
Filter Logics on ω1984-01-01Paper
Blunt and topless end extensions of models of set theory1983-01-01Paper
Set theory with a filter quantifier1983-01-01Paper
A correction to “stationary logic”1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39196811981-01-01Paper
Filter logics: Filters on ω11981-01-01Paper
Σ1-well-founded compactness1980-01-01Paper
A new omitting types theorem for L(Q)1979-01-01Paper
Stationary logic1978-01-01Paper
A Rather Classless Model1977-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Matt Kaufmann