enumerable language
111Ontology — This article concerns ontology in philosophy. For the concept in information science, see Ontology (information science). Not to be confused with the medical concepts of oncology and odontology, or indeed ontogeny. Parmenides was among the first… …
112Reverse mathematics — is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. The method can briefly be described as going backwards from the theorems to the axioms. This contrasts with the ordinary… …
113Punjabi University — Infobox University name = Punjabi University native name = ਪੰਜਾਬੀ ਯੂਨੀਵਰਿਸਟੀ image size = 200px caption = Aerial view of University motto = ਵਿਦਿਆ ਵੀਚਾਰੀ ਤਾ ਪਰਉਪਕਾਰੀ (True learning induces in the mind service of mankind) established = 1962… …
114Argument — This article is about the subject as it is studied in logic and philosophy. For other uses, see Argument (disambiguation). In philosophy and logic, an argument is an attempt to persuade someone of something, by giving reasons or evidence for… …
115Propaganda — This article is about the form of communication. For other uses, see Propaganda (disambiguation). French Military Propaganda postcard showing a caricature of Kaiser Wilhelm II biting the world (c. 1915) …
116Reference — For help in citing references, see Wikipedia:Citing sources. For the Wikipedia Reference Desk, see Wikipedia:Reference desk. Reference is derived from Middle English referren, from Middle French rèférer, from Latin referre, to carry back , formed …
117Modal logic — is a type of formal logic that extends classical propositional and predicate logic to include operators expressing modality. Modals words that express modalities qualify a statement. For example, the statement John is happy might be qualified by… …
118Inductive inference — This article is about the mathematical concept, for inductive inference in logic, see Inductive reasoning. Around 1960, Ray Solomonoff founded the theory of universal inductive inference, the theory of prediction based on observations; for… …
119Turing jump — In computability theory, the Turing jump or Turing jump operator, named for Alan Turing, is intuitively described as an operation that assigns to each decision problem X a successively harder decision problem X prime; with the property that X… …
120List of fallacies — For specific popular misconceptions, see List of common misconceptions. A fallacy is incorrect argumentation in logic and rhetoric resulting in a lack of validity, or more generally, a lack of soundness. Contents 1 Formal fallacies 1.1… …
