Self-reference

thumb|right|250px|A Koch snowflake has an infinitely repeating self-similarity when it is magnified. thumb|300px|Standard (trivial) self-similarity

first-person singular personal pronoun

acronym whose meaning refers to itself

Greek prefix: prefix of abstraction

thumb|The ancient symbol Ouroboros, a dragon that continually consumes itself, denotes self-reference.

Acrophony (; + 'sound') is the naming of letters of an alphabetic writing system so that a letter's name begins with the letter itself. For example, Greek letter names are acrophonic: the names of the letters α, β, γ, δ, are spelled with the respective letters: (), (), (), ().

adage

formula that visually represents itself when graphed

in set theory, a set which contains all objects, including itself

Phobophobia is a phobia defined as the fear of phobias, or the fear of fear, including intense anxiety and unrealistic and persistent fear of the somatic sensations and the feared phobia ensuing. Phobophobia can also be defined as the fear of phobias or fear of developing a phobia. Phobophobia is related to anxiety disorders and panic attacks directly linked to other types of phobias, such as agoraphobia. When a patient has developed phobophobia, their condition must be diagnosed and treated as part of anxiety disorders.

word that expresses a property it also possesses

In sociology of knowledge, the circular relationships between cause and effect

chain of logical connections that form a loop

cyclic structure that goes through several levels in a hierarchical system.

type of joke, where humor is alluding to on-self or the subject displaying the humor

In mathematics, logic and philosophy of mathematics, something that is impredicative is a self-referencing definition. Roughly speaking, a definition is impredicative if it invokes (mentions or quantifies over) the set being defined, or (more commonly) another set that contains the thing being defined. There is no generally accepted precise definition of what it means to be predicative or impredicative. Authors have given different but related definitions.

Wikimedia template

psychological model

In computer science, corecursion is a type of operation that is dual to (structural) recursion. Whereas recursion consumes a data structure by first handling the topmost layer before descending into its inner parts, corecursion produces a data structure by first defining the topmost layer before defining its inner parts. Corecursion is a particularly important in total languages, as it allows encoding potentially non-terminating computations in a context where every function must terminate. It is supported by theorem provers Agda and Rocq.

variants of axiomatic set theory that allow sets to be elements of themselves