The goal of reverse mathematics is to study the implication and non-implication relationships between theorems. These relationships have their own internal logic, allowing some implications and non-implications to be derived directly from others. The goal of this thesis is to characterize this logic in order to capture the relationships between specific mathematical works. The results of our study are a finite set of rules for this logic and the corresponding soundness and completeness theorems. We also compare our logic with modal logic and strict implication logic. In addition, we explain two applications of S-logic in topology and second order arithmetic
We will overview the results in an informal approach to constructive reverse mathematics, that is re...
Maslov’s inverse method is an automated theorem proving method: it can be used to develop computer p...
We show that when certain statements are provable in subsystems of constructive analysis using intui...
The implication relationship between subsystems in Reverse Mathematics has an underlying logic, whic...
Building on previous work by Mummert, Saadaoui and Sovine, we study the logic underlying the web of ...
This book presents reverse mathematics to a general mathematical audience for the first time. Revers...
It is a striking fact from reverse mathematics that almost all theorems of countable and countably r...
The present work investigates inductive inference from the perspective of reverse mathematics. Reve...
Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theore...
International audienceReverse mathematics is a new field that seeks to find the axioms needed to pro...
The aim of Reverse Mathematics(RM for short)is to find the minimal axioms needed to prove a given th...
Reverse Mathematics seeks to find the minimal set existence or comprehension axioms needed to prove ...
Reverse Mathematics is a program in the foundations of mathematics initiated by Harvey Friedman and ...
Abstract. We show that each of the five basic theories of second order arithmetic that play a centra...
Reverse Mathematics is a program in the foundations of math- ematics. It provides an elegant classif...
We will overview the results in an informal approach to constructive reverse mathematics, that is re...
Maslov’s inverse method is an automated theorem proving method: it can be used to develop computer p...
We show that when certain statements are provable in subsystems of constructive analysis using intui...
The implication relationship between subsystems in Reverse Mathematics has an underlying logic, whic...
Building on previous work by Mummert, Saadaoui and Sovine, we study the logic underlying the web of ...
This book presents reverse mathematics to a general mathematical audience for the first time. Revers...
It is a striking fact from reverse mathematics that almost all theorems of countable and countably r...
The present work investigates inductive inference from the perspective of reverse mathematics. Reve...
Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theore...
International audienceReverse mathematics is a new field that seeks to find the axioms needed to pro...
The aim of Reverse Mathematics(RM for short)is to find the minimal axioms needed to prove a given th...
Reverse Mathematics seeks to find the minimal set existence or comprehension axioms needed to prove ...
Reverse Mathematics is a program in the foundations of mathematics initiated by Harvey Friedman and ...
Abstract. We show that each of the five basic theories of second order arithmetic that play a centra...
Reverse Mathematics is a program in the foundations of math- ematics. It provides an elegant classif...
We will overview the results in an informal approach to constructive reverse mathematics, that is re...
Maslov’s inverse method is an automated theorem proving method: it can be used to develop computer p...
We show that when certain statements are provable in subsystems of constructive analysis using intui...