The following pages link to Jeff Paris (Q264026):
Displaying 50 items.
- ON THE STRUCTURE OF PROBABILITY FUNCTIONS IN THE NATURAL WORLD (Q3427886) (← links)
- (Q3470461) (← links)
- (Q3509215) (← links)
- Inference Processes for Quantified Predicate Knowledge (Q3511463) (← links)
- Language Invariance and Spectrum Exchangeability in Inductive Logic (Q3524926) (← links)
- A General Representation Theorem for Probability Functions Satisfying Spectrum Exchangeability (Q3576070) (← links)
- A Note on the Least Informative Model of a Theory (Q3576222) (← links)
- Instantial Relevance in Polyadic Inductive Logic (Q3601807) (← links)
- A PROPERTY OF 2‐SORTED PEANO MODELS AND PROGRAM VERIFICATION (Q3677763) (← links)
- On the structure of models of bounded $E\sb 1$-induction (Q3682483) (← links)
- The Pigeonhole Principle and Fragments of Arithmetic (Q3688388) (← links)
- (Q3689182) (← links)
- Regularity in models of arithmetic (Q3708802) (← links)
- A Note on a Theorem of H. FRIEDMAN (Q3753990) (← links)
- (Q3773860) (← links)
- Combinatorial principles concerning approximations of functions (Q3788005) (← links)
- On parameter free induction schemas (Q3834043) (← links)
- Closure properties of countable non-standard integers (Q3853628) (← links)
- (Q3884109) (← links)
- (Q3893931) (← links)
- (Q3931384) (← links)
- (Q3931391) (← links)
- (Q3964542) (← links)
- Accessible Independence Results for Peano Arithmetic (Q3966112) (← links)
- (Q4087182) (← links)
- Measure and minimal degrees (Q4132509) (← links)
- (Q4138726) (← links)
- Models of arithmetic and the 1-3-1 lattice (Q4161327) (← links)
- Sets Satisfying 0# (Q4168921) (← links)
- Note on an induction axiom (Q4182473) (← links)
- Some independence results for Peano arithmetic (Q4194958) (← links)
- Provability of the pigeonhole principle and the existence of infinitely many primes (Q4206725) (← links)
- Proof systems for probabilistic uncertain reasoning (Q4227878) (← links)
- The Uncertain Reasoner's Companion (Q4325548) (← links)
- More on the free subset problem (Q4404893) (← links)
- When Maximizing Entropy gives the Rational Closure (Q4405679) (← links)
- Rational Pavelka predicate logic is a conservative extension of Łukasiewicz predicate logic (Q4508252) (← links)
- (Q4530894) (← links)
- (Q4549471) (← links)
- (Q4613681) (← links)
- Deriving Information from Inconsistent Knowledge Bases: A Completeness Theorem for (Q4664018) (← links)
- (Q4729763) (← links)
- Patterns of Indiscernibles (Q4773709) (← links)
- (Q4919768) (← links)
- The liar paradox and fuzzy logic (Q4953224) (← links)
- (Q4967706) (← links)
- Pure Inductive Logic (Q5179557) (← links)
- (Q5202178) (← links)
- PURE INDUCTIVE LOGIC WITH FUNCTIONS (Q5207558) (← links)
- The Twin Continua of Inductive Methods (Q5213577) (← links)
