The following pages link to Kenneth McAloon (Q581399):
Displaying 39 items.
- On Gödel incompleteness and finite combinatorics (Q581400) (← links)
- (Q688577) (redirect page) (← links)
- A note on the parallel complexity of anti-unification (Q688579) (← links)
- Petri nets and large finite sets (Q1060848) (← links)
- (Q1122992) (redirect page) (← links)
- Stratification and knowledge base management (Q1122994) (← links)
- A canonical form for generalized linear constraints (Q1186697) (← links)
- Computational complexity and constraint logic programming languages (Q1354033) (← links)
- Logic, modeling, and programming (Q1368376) (← links)
- Independent Statements about Finite Stretchable Structures (Q3032248) (← links)
- Reducibilities Among Decision Problems for HNN Groups, Vector Addition Systems and Subsystems of Peano Arithmetic (Q3035687) (← links)
- (Q3037422) (← links)
- (Q3043148) (← links)
- (Q3050421) (← links)
- (Q3205227) (← links)
- Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic (Q3335777) (← links)
- (Q3476799) (← links)
- On the complexity of models of arithmetic (Q3669417) (← links)
- (Q3671967) (← links)
- (Q3717036) (← links)
- (Q3778734) (← links)
- (Q3874194) (← links)
- (Q3907560) (← links)
- (Q3912791) (← links)
- (Q3912792) (← links)
- Indicators, recursive saturation and expandability (Q3949050) (← links)
- (Q3962993) (← links)
- On the sequence of models $HOD_n$ (Q4047547) (← links)
- (Q4063136) (← links)
- (Q4067291) (← links)
- (Q4100087) (← links)
- Completeness Theorems, Incompleteness Theorems and Models of Arithmetic (Q4168612) (← links)
- (Q4331789) (← links)
- (Q4377041) (← links)
- (Q4944861) (← links)
- (Q4967707) (← links)
- (Q5622186) (← links)
- Consistency results about ordinal definability (Q5631103) (← links)
- Forcing and generalized quantifiers (Q5675697) (← links)
