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

RAMSEY’S THEOREM FOR SINGLETONS AND STRONG COMPUTABLE REDUCIBILITY DAMIR D. DZHAFAROV, LUDOVIC PATEY, REED SOLOMON, AND LINDA BROWN WESTRICK Abstract. We answer a question posed by Hirschfeldt and Jockusch by showing

Source URL: ludovicpatey.com

• Mathematics
• Mathematical analysis
• Differential forms
• Constructible universe
• Closed and exact differential forms
• Computability theory
• Combinatory logic
• Ordinal number
• Differential forms on a Riemann surface
• Banach fixed-point theorem

OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set

Source URL: ludovicpatey.com

• Computability theory
• Mathematical logic
• Proof theory
• Theory of computation
• Logic in computer science
• Computable function
• Reverse mathematics
• PA degree
• Peano axioms

THE WEAKNESS OF BEING COHESIVE, THIN OR FREE IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this pape

Source URL: ludovicpatey.com

• Computability theory
• Computable function
• Computation in the limit
• Second-order arithmetic
• Compactness theorem
• Reverse mathematics
• 01 class
• PA degree
• Low
• Algorithmically random sequence
• Computable number

Structured contact force optimization for kino-dynamic motion generation arXiv:submitcs.RO] 27 MayAlexander Herzog1 , Stefan Schaal1,2 , Ludovic Righetti1

Source URL: is.tuebingen.mpg.de

Ramsey-type graph coloring and diagonal non-computability Ludovic Patey Abstract A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions pla

Source URL: ludovicpatey.com

• Computability theory
• Theory of computation
• Mathematics
• Theoretical computer science
• Mathematical analysis
• Computable function
• Sigma-algebra
• Generalised Whitehead product

THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. No natural principle is currently known to be strictly between the arithmetic comprehension axiom (ACA0 ) and Ramsey’s theorem f

Source URL: ludovicpatey.com

• Large numbers
• Mathematical notation
• Probability theory
• Differential forms
• Symbol

Devoir maison sur l’´elimination des coupures Ludovic Patey 29 janvier

Source URL: lmfi.fr

Π01 ENCODABILITY AND OMNISCIENT REDUCTIONS BENOIT MONIN AND LUDOVIC PATEY Abstract. A set of integers A is computably encodable if every infinite set of integers has an infinite subset computing A. By a result of Solova

Source URL: ludovicpatey.com

• Computability theory
• 01 class
• Riemann surfaces
• Probability theory
• Measure theory
• Differential forms on a Riemann surface
• Modulus of continuity

ON THE LOGICAL STRENGTHS OF PARTIAL SOLUTIONS TO MATHEMATICAL PROBLEMS LAURENT BIENVENU, LUDOVIC PATEY, AND PAUL SHAFER ABSTRACT. We use the framework of reverse mathematics to address the question of, given a mathematic

Source URL: ludovicpatey.com

• Computability theory
• Logic
• Proof theory
• Mathematics
• Mathematical logic
• Reverse mathematics
• Model theory
• Philosophy of mathematics
• Symbol
• Fixed-point theorems
• Primitive recursive functional
• Generalised Whitehead product