<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.sarg.dev/index.php?action=history&amp;feed=atom&amp;title=Predicate_variable</id>
	<title>Predicate variable - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.sarg.dev/index.php?action=history&amp;feed=atom&amp;title=Predicate_variable"/>
	<link rel="alternate" type="text/html" href="https://wiki.sarg.dev/index.php?title=Predicate_variable&amp;action=history"/>
	<updated>2026-06-24T20:11:04Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.44.2</generator>
	<entry>
		<id>https://wiki.sarg.dev/index.php?title=Predicate_variable&amp;diff=595781&amp;oldid=prev</id>
		<title>imported&gt;Halscode: Adding short description: &quot;Type of mathematical variable&quot;</title>
		<link rel="alternate" type="text/html" href="https://wiki.sarg.dev/index.php?title=Predicate_variable&amp;diff=595781&amp;oldid=prev"/>
		<updated>2025-03-04T00:45:49Z</updated>

		<summary type="html">&lt;p&gt;Adding &lt;a href=&quot;https://en.wikipedia.org/wiki/Short_description&quot; class=&quot;extiw&quot; title=&quot;wikipedia:Short description&quot;&gt;short description&lt;/a&gt;: &amp;quot;Type of mathematical variable&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Short description|Type of mathematical variable}}&lt;br /&gt;
In [[mathematical logic]], a &amp;#039;&amp;#039;&amp;#039;predicate variable&amp;#039;&amp;#039;&amp;#039; is a [[Predicate (mathematical logic)|predicate]] letter which functions as a &amp;quot;placeholder&amp;quot; for a [[Finitary relation|relation]] (between terms), but which has not been specifically assigned any particular relation (or meaning). Common symbols for denoting predicate variables include capital [[Latin script|roman letters]] such as &amp;lt;math&amp;gt;P&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;Q&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;R&amp;lt;/math&amp;gt;, or lower case roman letters, e.g., &amp;lt;math&amp;gt;x&amp;lt;/math&amp;gt;.&amp;lt;ref&amp;gt;{{Cite web|title=Predicate variable - Encyclopedia of Mathematics|url=https://encyclopediaofmath.org/wiki/Predicate_variable|access-date=2020-08-20|website=encyclopediaofmath.org}}&amp;lt;/ref&amp;gt; In [[first-order logic]], they can be more properly called [[metalinguistic variable]]s. In [[higher-order logic]], predicate variables correspond to [[propositional variable]]s which can stand for [[well-formed formula]]s of the same logic, and such variables can be quantified by means of (at least) second-order [[Quantifier (logic)|quantifiers]].&lt;br /&gt;
&lt;br /&gt;
== Notation ==&lt;br /&gt;
Predicate variables should be distinguished from predicate constants, which could be represented either with a different (exclusive) set of predicate letters, or by their own symbols which really do have their own specific meaning in their [[domain of discourse]]: e.g. &amp;lt;math&amp;gt; =, \ \in , \ \le,\ &amp;lt;, \ \sub,... &amp;lt;/math&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
If letters are used for both predicate constants and predicate variables, then there must be a way of distinguishing between them. One possibility is to use letters &amp;#039;&amp;#039;W&amp;#039;&amp;#039;, &amp;#039;&amp;#039;X&amp;#039;&amp;#039;, &amp;#039;&amp;#039;Y&amp;#039;&amp;#039;, &amp;#039;&amp;#039;Z&amp;#039;&amp;#039; to represent predicate variables and letters &amp;#039;&amp;#039;A&amp;#039;&amp;#039;, &amp;#039;&amp;#039;B&amp;#039;&amp;#039;, &amp;#039;&amp;#039;C&amp;#039;&amp;#039;,..., &amp;#039;&amp;#039;U&amp;#039;&amp;#039;, &amp;#039;&amp;#039;V&amp;#039;&amp;#039; to represent predicate constants. If these letters are not enough, then numerical subscripts can be appended after the letter in question (as in &amp;#039;&amp;#039;X&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;, &amp;#039;&amp;#039;X&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;, &amp;#039;&amp;#039;X&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;3&amp;lt;/sub&amp;gt;). &lt;br /&gt;
&lt;br /&gt;
Another option is to use Greek lower-case letters to represent such metavariable predicates. Then, such letters could be used to represent entire well-formed formulae (wff) of the predicate calculus: any free variable terms of the wff could be incorporated as terms of the Greek-letter predicate. This is the first step towards creating a higher-order logic.&lt;br /&gt;
&lt;br /&gt;
== Usage ==&lt;br /&gt;
&lt;br /&gt;
If the predicate variables are not defined as belonging to the vocabulary of the predicate calculus, then they are predicate &amp;#039;&amp;#039;&amp;#039;metavariables&amp;#039;&amp;#039;&amp;#039;, whereas the rest of the predicates are just called &amp;quot;predicate letters&amp;quot;. The metavariables are thus understood to be used to code for [[axiom schema]] and theorem schemata (derived from the axiom schemata). &lt;br /&gt;
&lt;br /&gt;
Whether the &amp;quot;predicate letters&amp;quot; are constants or variables is a subtle point: they are not constants in the same sense that &amp;lt;math&amp;gt; =, \ \in , \ \le,\ &amp;lt;, \ \sub, &amp;lt;/math&amp;gt; are predicate constants, or that &amp;lt;math&amp;gt; 1,\ 2,\ 3,\ \sqrt{2},\ \pi,\ e\ &amp;lt;/math&amp;gt; are numerical constants.&lt;br /&gt;
&lt;br /&gt;
If &amp;quot;predicate variables&amp;quot; are only allowed to be bound to predicate letters of zero [[arity]] (which have no arguments), where such letters represent [[propositional logic|propositions]], then such variables are &amp;#039;&amp;#039;[[propositional variable|propositional variables]]&amp;#039;&amp;#039;, and any predicate logic which allows second-order quantifiers to be used to bind such propositional variables is a second-order predicate calculus, or [[second-order logic]].&lt;br /&gt;
&lt;br /&gt;
If predicate variables are also allowed to be bound to predicate letters which are unary or have higher arity, and when such letters represent &amp;#039;&amp;#039;[[propositional function]]s&amp;#039;&amp;#039;, such that the domain of the arguments is mapped to a range of different propositions, and when such variables can be bound by quantifiers to such sets of propositions, then the result is a higher-order predicate calculus, or [[higher-order logic]].&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
&lt;br /&gt;
* {{annotated link|Functional predicate}}&lt;br /&gt;
* {{annotated link|Metavariable}}&lt;br /&gt;
* {{annotated link|Propositional variable}}&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
&amp;lt;references /&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Bibliography==&lt;br /&gt;
* [[Rudolf Carnap]] and William H. Meyer. &amp;#039;&amp;#039;Introduction to Symbolic Logic and Its Applications.&amp;#039;&amp;#039;  Dover Publications (June 1, 1958). {{isbn|0-486-60453-5}}&lt;br /&gt;
&lt;br /&gt;
{{Mathematical logic}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Predicate logic]]&lt;br /&gt;
[[Category:Logic symbols]]&lt;/div&gt;</summary>
		<author><name>imported&gt;Halscode</name></author>
	</entry>
</feed>