Abstract structure

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages) This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Abstract structure" – news · newspapers · books · scholar · JSTOR (November 2022) (Learn how and when to remove this message) This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details. (June 2022) (Learn how and when to remove this message) (Learn how and when to remove this message)

An abstract structure is an abstraction that might be of the geometric spaces or a set structure, or a hypostatic abstraction that is defined by a set of mathematical theorems and laws, properties and relationships in a way that is logically if not always historically independent ^[1] of the structure of contingent experiences, for example, those involving physical objects. Abstract structures are studied not only in logic and mathematics but in the fields that apply them, as computer science and computer graphics, and in the studies that reflect on them, such as philosophy (especially the philosophy of mathematics). Indeed, modern mathematics has been defined in a very general sense as the study of abstract structures (by the Bourbaki group: see discussion there, at algebraic structure and also structure).

An abstract structure may be represented (perhaps with some degree of approximation) by one or more physical objects – this is called an implementation or instantiation of the abstract structure. But the abstract structure itself is defined in a way that is not dependent on the properties of any particular implementation.

An abstract structure has a richer structure than a concept or an idea. An abstract structure must include precise rules of behaviour which can be used to determine whether a candidate implementation actually matches the abstract structure in question, and it must be free from contradictions. Thus we may debate how well a particular government fits the concept of democracy, but there is no room for debate over whether a given sequence of moves is or is not a valid game of chess (for example Kasparovian approaches).

• A sorting algorithm is an abstract structure, but a recipe is not, because it depends on the properties and quantities of its ingredients.
• A simple melody is an abstract structure, but an orchestration is not, because it depends on the properties of particular instruments.
• Euclidean geometry is an abstract structure, but the theory of continental drift is not, because it depends on the geology of the Earth.
• A formal language is an abstract structure, but a natural language is not, because its rules of grammar and syntax are open to debate and interpretation.

• Abstraction in computer science
• Abstraction in general
• Abstraction in mathematics
• Abstract object
• Deductive apparatus
• Formal sciences
• Mathematical structure

This mathematical logic-related article is a stub. You can help Wikipedia by expanding it.

• v
• t
• e