Definition
In mathematics, Church encoding is a way of representing various data types in the lambda calculus.
Related concepts
A. C. CroomAbstract logicAckermann set theoryAdditionAlan TuringAleph numberAlfred Foster (mathematician)Algebraic data typeAlgebraic logicAlonzo ChurchAlonzo Church (college president)Alphabet (formal languages)ArgumentArithmeticArityAtomic formulaAtomic model (mathematical logic)Atomic sentenceAutomata theoryAutomated theorem provingAxiomAxiom of choiceAxiom schemaAxiomatic systemAxiomatization of Boolean algebrasBanach–Tarski paradoxBenjamin C. PierceBeta reductionBijectionBinary operationBoolean algebraBoolean algebras canonically definedBoolean functionC. Anthony AndersonCantor's diagonal argumentCantor's paradoxCantor's theoremCardinalityCartesian productCategorical theoryCategory (mathematics)Category of setsCategory theoryChurch's theoremChurch–Rosser theoremChurch–Turing thesisClass (set theory)Classical logicCodomainCompactness theoremComplement (set theory)Complete theoryComputability theoryComputable functionComputable numberComputable setComputably enumerable setConcrete categoryConsConservative extensionConsistencyConstructible universeConstruction of the real numbersConstructive set theoryContinuationContinuum hypothesisCountable setCountingDana ScottData structureDecidability (logic)Decision problemDeductive lambda calculusDeductive systemDiagram (mathematical logic)Division (mathematics)Domain of a functionElement (mathematics)Elementary diagramElementary equivalenceElementary function arithmeticEmpty setEnumerationEquiconsistencyEquivalence relationEuclid's ElementsEuclidean geometryExistential quantificationExponentiationExpression (mathematics)Extension by definitionsExtension by new constant and function namesExtensionalityFinitary relationFinite-valued logicFinite model theoryFinite setFirst-order logicFixed-point combinatorFixed-point logicFold (higher-order function)Forcing (mathematics)Formal grammarFormal languageFormal proofFormal semantics (logic)Formal systemFormation ruleFoundations of geometryFoundations of mathematicsFree logicFree variables and bound variablesFrege–Church ontologyFunction (mathematics)Function compositionFunction typeFunctional compositionFunctional predicateFunctional programmingFuzzy setGary R. MarGeneral set theoryGeorge Alfred BarnardGitHubGrothendieck universeGround expressionGround formulaGödel's completeness theoremGödel's incompleteness theoremsGödel numberingHalting problemHartley Rogers, JrHaskell (programming language)Hereditary setHigher-order functionHigher-order logicHigher-ranked typeHilbert's axiomsHilbert systemHistory of logicHistory of mathematical logicImage (mathematics)Inaccessible cardinalIndependence (mathematical logic)InferenceInfinite-valued logicInfinite setInformation theoryInhabited setInjective functionIntegerInterpretation (logic)Interpretation (model theory)Interpretation functionIntersection (set theory)IsomorphismJ. Barkley RosserJohn George KemenyKolmogorov complexityKripke's theory of truthKripke–Platek set theoryLambda calculusLarge cardinalLemma (mathematics)Leon HenkinLindström's theoremLinked listList (abstract data type)List (computing)List of Hilbert systemsList of axiomsList of first-order theoriesList of formal systemsList of mathematical theoriesList of set identities and relationsList of statements independent of ZFCLogicLogical biconditionalLogical conjunctionLogical connectiveLogical consequenceLogical constantLogical disjunctionLogical equalityLogical equivalenceLogical truthLogicismLöwenheim–Skolem theoremMIT PressMany-valued logicMap (mathematics)Martin Davis (mathematician)Material conditionalMathematical logicMathematical objectMathematicsMaurice L'AbbéMetalanguageMichael O. RabinMinimal axioms for Boolean algebraModel complete theoryModel theoryMogensen–Scott encodingMonadic predicate calculusMonadic second-order logicMonusMorse–Kelley set theoryMultiplicationNP (complexity)Naive set theoryNatural deductionNatural numberNegationNew FoundationsNicholas RescherNode (computer science)Non-Euclidean geometryNon-logical symbolNon-standard modelNon-standard model of arithmeticNorman ShapiroOpen formulaOperation (mathematics)Ordinal analysisOrdinal numberOstensive definitionP (complexity)P versus NP problemParadoxes of set theoryPartition of a setPattern matchingPeano axiomsPeter B. AndrewsPhilosophy of mathematicsPico (programming language)Power setPredicate (mathematical logic)Predicate logicPredicate variablePrime modelPrimitive recursive arithmeticPrimitive recursive functionPrinceton UniversityPrincipia MathematicaProof of impossibilityProof theoryPropositionPropositional calculusPropositional formulaPropositional variableQuantifier (logic)Quantifier rankRaymond SmullyanRecursionRecursive setRelation (mathematics)Reverse mathematicsRice UniversityRobinson arithmeticRule of inferenceRussell's paradoxSatisfiabilitySaturated modelScala (programming language)Schröder–Bernstein theoremSecond-order arithmeticSecond-order logicSelf-verifying theoriesSemantic theory of truthSemantics of logicSentence (mathematical logic)Sequent calculusSet (mathematics)Set theorySignature (logic)Simon B. KochenSimply typed lambda calculusSingleton (mathematics)Skolem arithmeticSmalltalkSoundnessSpectrum of a sentenceSpectrum of a theorySquare of oppositionStephen Cole KleeneStrength (mathematical logic)String (formal languages)Structure (mathematical logic)Substitution (logic)Substructure (mathematics)SubtractionSuccessor functionSupertaskSurjective functionSyllogismSymbol (formal)Syntax (logic)System FT-schemaTarski's axiomatization of the realsTarski's axiomsTarski's theory of truthTarski's undefinability theoremTarski–Grothendieck set theoryTautology (logic)Term (logic)Term logicTetrationTheoremTheories of truthTheory (mathematical logic)Three-valued logicTimeline of mathematical logicTransfer principleTransitive setTrue arithmeticTruth predicateTruth tableTruth valueTuring machineType (model theory)Type theoryTypes and Programming LanguagesUltrafilter (set theory)UltraproductUnary numeral systemUncountable setUndecidable problemUninterpreted functionUnion (set theory)Uniqueness quantificationUniversal quantificationUniversal setUniverse (mathematics)University of California, Los AngelesUrelementValidity (logic)Variable (mathematics)Venn diagramVon Neumann universeVon Neumann–Bernays–Gödel set theoryWell-formed formulaWilliam Bigelow EastonWilliam Boone (mathematician)Zermelo–Fraenkel set theory
137 concepts already in your glossary