logicSystem

P4930
predicate

Indicates a relationship where an entity is associated with, defined within, or governed by a particular logical framework or system of formal reasoning.

Try in SPARQL

All labels observed (5)

Label Occurrences
hasAxiomSystem 7
logicalFramework 3
logicSystem canonical 1

Description generation (PDg)

The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.

Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning.  
# Instructions
Focus on describing the relationship, not the entities themselves. 
# Response Format
Begin the description with \' Indicates...\'
Input
Predicate: logicSystem
Generated description
Indicates a relationship where an entity is associated with, defined within, or governed by a particular logical framework or system of formal reasoning.

Sample triples (13)

Subject Object
Principia Mathematica ramified theory of types ⓘ
Zermelo–Fraenkel set theory first-order logic via predicate surface "logicalFramework" ⓘ
Frege’s system in "Grundgesetze der Arithmetik" axiomatic calculus for functions and objects via predicate surface "logicalFramework" ⓘ
set theory Zermelo–Fraenkel set theory via predicate surface "hasAxiomSystem" ⓘ
set theory Zermelo–Fraenkel set theory via predicate surface "hasAxiomSystem" ⓘ
surface form: Zermelo–Fraenkel set theory with Choice
set theory von Neumann–Bernays–Gödel set theory via predicate surface "hasAxiomSystem" ⓘ
set theory Kripke–Platek set theory via predicate surface "hasAxiomSystem" ⓘ
set theory naive set theory via predicate surface "hasAxiomSystem" ⓘ
Kazimierz Kuratowski Kuratowski closure axioms via predicate surface "hasAxiomSystem" ⓘ
Euclidean geometry Euclid's postulates via predicate surface "hasAxiomSystem" NERFINISHED ⓘ
TLA linear-time temporal logic via predicate surface "logicalFoundation" ⓘ
Grundgesetze der Arithmetik, Volume I Frege’s Begriffsschrift-based notation via predicate surface "logicalSystem" ⓘ
Rosser’s trick in incompleteness proofs first-order arithmetic via predicate surface "logicalFramework" ⓘ