About: Reverse mathematics

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Reverse mathematics Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Work, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FReverse_mathematics&graph=http%3A%2F%2Fdbpedia.org&graph=http%3A%2F%2Fdbpedia.org

Reverse mathematics is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. Its defining method can briefly be described as "going backwards from the theorems to the axioms", in contrast to the ordinary mathematical practice of deriving theorems from axioms. It can be conceptualized as sculpting out necessary conditions from sufficient ones.

Attributes	Values
rdf:type	work
rdfs:label	Reverse Mathematik (de) Mathématiques à rebours (fr) Matematica inversa (it) 逆数学 (ja) Reverse mathematics (en) 逆数学 (zh)
rdfs:comment	Die reverse Mathematik, ein Teilgebiet der mathematischen Logik, versucht zu bestimmen, welche Axiome notwendig sind, um bestimmte Theoreme zu beweisen. Reverse Mathematik ist damit gewissermaßen die Umkehrung der gewöhnlichen Mathematik, die versucht, Theoreme aus Axiomen herzuleiten. Die reverse Mathematik wurde 1974 von Harvey Friedman als mathematisches Projekt aufgebracht. Die Idee dazu entstand aus Ergebnissen der Mengenlehre, unter anderem dem klassischen Theorem, dass das Auswahlaxiom und das Lemma von Zorn über der Zermelo-Fraenkel-Mengenlehre ZF äquivalent sind. (de) Les mathématiques à rebours sont une branche des mathématiques qui pourrait être définie simplement par l'idée de « remonter aux axiomes à partir des théorèmes », contrairement au sens habituel (des axiomes vers les théorèmes). Un peu plus précisément, il s'agit d'évaluer la robustesse logique d'un ensemble de résultats mathématiques usuels en déterminant exactement quels axiomes sont nécessaires et suffisants pour les prouver. (fr) 逆数学とは、数学の定理の証明に必要な公理を決定しようとする数理論理学のプログラムである。簡単に言えば、通常の数学が公理から定理を導くのとは逆に、「定理から公理を証明する」手法を用いることが特徴である。「選択公理とツォルンの補題はZF上で同値である」、というような集合論の古典的定理は、逆数学プログラムの予兆となるものだった。しかし、実際の逆数学では主に、集合論の公理ではなく、通常の数学の定理を研究するのを目的とする。逆数学は大抵の場合、について実行され、定理がと証明論に動機付けられたの部分体系のうち、どれに対応するのかを研究する。2階算術を使うことで、再帰理論からの多くの技術も利用できる。実際、逆数学の結果の多くは、計算可能性解析学の結果を反映している。逆数学は、によってはじめて言及された。基本文献はを参照。 (ja) 逆数学（Reverse mathematics）是数学的一个分支，大致可以看成是“从定理导向公理”而不是通常的方向(从公理到定理)。更精确一点，它试图通过找出证明所需的充分和必要的公理来评价一批常用数学结果的逻辑有效性。该领域由Harvey Friedman在其文章“二阶算术系统及其应用（Some systems of second order arithmetic and their use）”中创立。它被Stephen G. Simpson和他的学生以及其他一些人所追随。Simpson写了关于该主题的参考教科书二阶算数的子系统(Subsystems of Second Order Arithmetic);本条目大部分内容取自该书的简介性质的第一章。其他参考读物的细节参看。 (zh) Reverse mathematics is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. Its defining method can briefly be described as "going backwards from the theorems to the axioms", in contrast to the ordinary mathematical practice of deriving theorems from axioms. It can be conceptualized as sculpting out necessary conditions from sufficient ones. (en) La matematica inversa è un ramo della matematica che si occupa di determinare quali sono gli assiomi minimi necessari per dimostrare un particolare teorema e più in generale cerca di determinare la teoria base che costituisce la matematica nel suo complesso. Partendo da una base di assiomi debole, si può scoprire che molte proposizioni matematiche sono equivalenti all'assioma aggiunto ad essa per dimostrarlo, come ad esempio il lemma di Zorn rispetto all'assioma della scelta. (it)
dcterms:subject	Proof theory Computability theory Mathematical logic
Wikipage page ID	326365 (xsd:integer)
Wikipage revision ID	1123230385 (xsd:integer)
Link from a Wikipage to another Wikipage	Cambridge University Press Prime ideal Princeton University Press Elementary function arithmetic David Hilbert Determinacy Algebraic closure Archimedean property Jordan curve theorem Riemann integral Ulrich Kohlenbach University of Wisconsin–Madison Vector space Induction, bounding and least number principles Kőnig's lemma Compactness Computable function Countable set Analytical hierarchy Proof theory Mathematical logic Separable space Epsilon numbers (mathematics) Giuseppe Vitali Constructive analysis Theorem Ordered field Ordinal analysis Arithmetical hierarchy Lindelöf Closed-form expression Combinatorics Commutative ring Complete metric space Computable analysis Feferman–Schütte ordinal Low basis theorem Transcendence basis Primitive recursive arithmetic Steve Simpson (mathematician) Maximal ideal Topology Gödel's completeness theorem Heine–Borel theorem Law of excluded middle Robinson arithmetic Algorithmically random sequence Errett Bishop Field (mathematics) Cauchy sequence Gauge integral Proof theory Ring (mathematics) Group (mathematics) Gödel's incompleteness theorems Hahn–Banach theorem Hermann Weyl Baire category theorem Baire space Cousin Cousin's theorem Abstract algebra Computability theory Mathematical logic Supremum Effective Polish space Zorn's lemma Axiom Axiom of choice Bolzano–Weierstrass theorem Solomon Feferman Constructivism (philosophy of mathematics) Impredicativity Intermediate value theorem Metric space Natural number Necessity and sufficiency Open set Cantor space Ramsey's theorem Rational number Real closed field

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software