Partial orders and immunity in reverse mathematics Ludovic Patey Laboratoire PPS, Université Paris Diderot, Paris, FRANCE

Source URL: ludovicpatey.com

Les «!arbres empilés!»!: une nouvelle approche pour la visualisation des grands dendrogrammes Gilles Bisson, Ludovic Patey Laboratoire TIMC-IMAG, CNRS / UJF 5525 Université de Grenoble - Domaine de la MerciLa

Source URL: ludovicpatey.com

COLORING THE RATIONALS IN REVERSE MATHEMATICS EMANUELE FRITTAION AND LUDOVIC PATEY Abstract. Ramsey’s theorem for pairs asserts that every 2-coloring of the pairs of integers has an infinite monochromatic subset. In th

Source URL: www.math.tohoku.ac.jp

• Logic in computer science
• Differential forms
• Combinatory logic
• Lambda calculus
• Peano axioms
• Closed and exact differential forms
• Banach fixed-point theorem
• Peetre theorem

The complexity of satisfaction problems in Reverse Mathematics Ludovic Patey Laboratoire PPS, Université Paris Diderot, Paris, FRANCE

Source URL: ludovicpatey.com

• Logic
• Mathematics
• Constraint programming
• Abstraction
• Model theory
• Boolean satisfiability problem
• Electronic design automation
• Logic in computer science
• Complexity of constraint satisfaction
• Constraint satisfaction problem
• Satisfiability
• Binary relation

DEGREES BOUNDING PRINCIPLES AND UNIVERSAL INSTANCES IN REVERSE MATHEMATICS LUDOVIC PATEY ABSTRACT. A Turing degree d bounds a principle P of reverse mathematics if every computable instance of P has a d-computable soluti

Source URL: ludovicpatey.com

• Mathematics
• Mathematical analysis
• Theory of computation
• Computability theory
• Theoretical computer science
• Computation in the limit
• Computable function
• Differential forms on a Riemann surface
• Congruence lattice problem

Monadic Translation of Multi-Staged Languages Ludovic Patey Kwangkeun Yi

Source URL: ludovicpatey.com

• Software engineering
• Computer programming
• Declarative programming
• Functional programming
• Models of computation
• Monad
• Substitution
• Lambda calculus

Partial Orders and Immunity in Reverse Mathematics Ludovic Patey Laboratoire PPS, Université Paris Diderot, Paris, FRANCE

Source URL: ludovicpatey.com

• Theoretical computer science
• Logic in computer science
• Mathematics
• Mathematical logic
• Combinatory logic
• Lambda calculus
• Unification
• Computability theory
• Differential forms on a Riemann surface
• Fredholm alternative

Math´ematiques `a rebours et un Lemme de K¨onig Faible de Type Ramsey Stage de Master 2 - MPRI mars - aoˆ ut 2012 Ludovic Patey ∗

Source URL: ludovicpatey.com

• Mathematical logic
• Computability theory
• Mathematics
• Theoretical computer science
• Proof theory
• Logic in computer science
• Theory of computation
• Second-order arithmetic
• Combinatory logic
• Reverse mathematics
• Computable function

ON COMBINATORIAL WEAKNESSES OF RAMSEYAN PRINCIPLES LUDOVIC PATEY ABSTRACT. Avoidance properties such as cone avoidance or PA avoidance for a principle P in reverse mathematics shows the effectiveness weakness of P. Stron

Source URL: ludovicpatey.com

• Computability theory
• Theory of computation
• Computable number
• Computable function
• 01 class
• Computation in the limit

THE COMPLEXITY OF SATISFACTION PROBLEMS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Satisfiability problems play a central role in computer science and engineering as a general framework for studying the complexity of

Source URL: ludovicpatey.com

• Automated theorem proving
• Logic programming
• Logic in computer science
• Boolean algebra
• Model theory
• Substitution
• Boolean satisfiability problem
• Interpretation
• Relationships among probability distributions
• Lifting theory