Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,757 papers from all fields of science
Search
Sign In
Create Free Account
Setoid
In mathematics, a setoid (also called an E-set) is a set (or type) equipped with an equivalence relation. Setoids are studied especially in proof…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Algorithm
Coq (software)
Curry–Howard correspondence
Extension (semantics)
Expand
Broader (2)
Category theory
Type theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Identity Criteria of CNs : Quantification and Copredication
2017
Corpus ID: 36585722
the situation becomes more subtle and evolved because, in such more complex situations, proper semantic treatments seem to…
Expand
2014
2014
Formalizing complex plane geometry
Filip Maric
,
Dan Petrovic
Annals of Mathematics and Artificial Intelligence
2014
Corpus ID: 254225301
Deep connections between complex numbers and geometry had been well known and carefully studied centuries ago. Fundamental…
Expand
2013
2013
Positive Inductive-Recursive Definitions
Neil Ghani
,
Lorenzo Malatesta
,
F. Forsberg
Log. Methods Comput. Sci.
2013
Corpus ID: 409399
We introduce a new theory of data types which allows for the definition of data types as initial algebras of certain functors Fam…
Expand
2013
2013
Programming in homotopy type theory and erasing propositions
G. Dijkstra
2013
Corpus ID: 118486075
In the recent years, homotopy type theory has become the subject of much study. Homotopy type theory studies the correspondence…
Expand
2013
2013
Yet another category of setoids with equality on objects
Erik Palmgren
2013
Corpus ID: 55308143
When formalizing mathematics in (generalized predicative) constructive type theories, or more practically in proof assistants…
Expand
2011
2011
Superposition as a logical glue
A. Asperti
,
E. Tassi
Types for Proofs and Programs
2011
Corpus ID: 1177226
The typical mathematical language systematically exploits notational and logical abuses whose resolution requires not just the…
Expand
2010
2010
Smart matching
A. Asperti
,
E. Tassi
AISC'10/MKM'10/Calculemus'10
2010
Corpus ID: 9762604
One of the most annoying aspects in the formalization of mathematics is the need of transforming notions to match a given…
Expand
2010
2010
Coiterative Morphisms: Interactive Equational Reasoning for Bisimulation, using Coalgebras
M. Niqui
2010
Corpus ID: 18217151
htmlabstractter: SEN 3 Abstract: We study several techniques for interactive equational reasoning with the bisimulation…
Expand
2010
2010
Remarks on the relation between families of setoids and identity in type theory
Erik Palmgren
2010
Corpus ID: 15511267
can be turned into a family represented by a function. This can be contrasted to MartinLöf type theory [10], and other theories…
Expand
2005
2005
On the Semantics of Coinductive Types in Martin-Löf Type Theory
F. Marchi
Conference on Algebra and Coalgebra in Computer…
2005
Corpus ID: 33083403
There are several approaches to the problem of giving a categorical semantics to Martin-Lof type theory with dependent sums and…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE