Wikipedia:Requested articles/Mathematics/Logic
Jump to navigation
Jump to search
This content was retrieved from Wikipedia : http://en.wikipedia.org/wiki/Wikipedia:Requested_articles/Mathematics/LogicAdd your request in the most appropriate place below. 
Before adding a request please:
Also, when adding a request, please include as much information as possible (such as webpages, articles, or other reference material) so editors can find and distinguish your request from an alreadycreated article. 
Contents
Model theory, proof theory, and recursion theory
 Behavioral semantics  An axiomatic semantics of concurrent programming languages, (see Lamport 1985)
 Enumeration reducibility
 Herbrand consistency  might be enough to explain this term in the consistency article.
 Homogeneous model  Model theory
 Method of indicators  Modeltheoretic method used to prove the Paris–Harrington theorem without diagonalization
 Proof identity  some references:

 Straßburger, Lutz (20 October 2006), "Proof Nets and the Identity of Proofs", Technical Report 6013, INRIA
 Kuznets, Roman (2007), "Proof Identity for Classical Logic: Generalizing to Normality", LFCS (PDF), pp. 332–348
 MO thread
 Subrecursion theory  The study of "levels of recursion", such as primitive recursion, double recursion and μrecursive functions (noted by, for example: Rose, H.E., "Subrecursion: Functions and hierarchies", Oxford University Press, New York, USA, 1984. ISBN 0198531893). Possibly a foreshadowing to computational complexity theory.
 Predicative arithmetic
 Hyperhyperimmune set
 Hyperhypersimple set
 Regressive set
 Retraceable set
 FefermanLevy model
Set theory
 Cmeasurable set
 Comprehensive set
 Canonical representative
 Extended set theory (D L Childs et al.)
 Hintikka set ^{[1]}
 Moschovakis' coding lemma (currently redirected to a page which doesn't mention the subject)
 Paris model
 proper forcing (this redirects to Proper Forcing Axiom, which would exclude such results as the fundamental theorem of proper forcing, preservation theorems, and other topics)
 Quasi strategy (for a game, currently redirected to a page which doesn't mention the subject)
 Scale property (currently redirected to a page which doesn't mention the subject)
 Scott analysis (should also have redirects from Scott sentence and Scott rank)
 Unfolded BanachMazur game
 Weakly homogeneously Suslin set
 Yannakakis' algorithm
 Totally ordered set (currently redirects to Total order, which isn't very clear on the subject at all)
Relations
 Bichotomous relation
 Trichotomous relation
 Heterogeneous relation
 Contact relation
 Regular relation
 Normalizing relation
 Consistent relation
 Definite relation
 Weakly dense relation
 Determinant relation
 Terminating relation
 Convergent relation
 Orthogonal relation
 Rooted relation
 Transitively connected relation
 Deterministic relation
 Cyclical relation
 Weakly connected relation
 Fuzzy relation
Other
 Requests listed in this section may belong somewhere else. Please help by moving them to a suitable location.
 Bernardete paradox
 Computational verb logic
 Nominal logic  perhaps related to Nominal terms (computer science) and Nominal techniques, see also [1]
 Nominal sets
 Ordersorted equational logic
 Phrases
 Propositional linear temporal logic
 ratio et res ipsa
 Trivial truth there is an article vacuous truth, and triviality but no article trivial truth, was thinking about making it an link to Tautology but then thought not all tautologies are trivial (obvious) truths, maybe P > P is the only tautology that really is an trivial truth.
References
 ^ https://pl.wikipedia.org/wiki/Zbi%C3%B3r_Hintikki
This page is based on the copyrighted Wikipedia article "Wikipedia:Requested articles/Mathematics/Logic"; it is used under the Creative Commons
AttributionShareAlike 3.0 Unported License (CCBYSA). You may
redistribute it, verbatim or modified, providing that you comply with
the terms of the CCBYSA