Content deleted Content added
corrected typo |
Added tags to the page using Page Curation (more footnotes) |
||
Line 1:
{{more footnotes|date=February 2025}}
In [[theoretical computer science]] and [[mathematical logic]], specifically in [[realizability]], a '''partial combinatory algebra''' (pca) is an algebraic structure which abstracts a [[model of computation]]. The definition of pcas uses an idea from [[combinatory logic]]. The [[realizability topos]] over a pca is a model of higher-order [[intuitionistic logic]] where informally every function is a program in the pca's model of computation.
| |||