what if say that set is a function which takes in any object and spits out yes or no.

• coq

  87 4,616 10.0 OCaml

  Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.

  

Sure we can. That's a common way to do it if your foundational theory is some version of type theory. For example, when you want to talk about sets in the Coq proof assistant (wich uses type theory as its foundational theory), this is exactly what you would do. Your "set of values of type T" would be something of the type T → Prop.

• InfluxDB

  www.influxdata.com featured

  Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

  

Suggest a related project