Sciweavers

203 search results - page 5 / 41
» Type Theory and the Informal Language of Mathematics
Sort
View
TOCL
2012
235views Formal Methods» more  TOCL 2012»
11 years 9 months ago
Topological and Simplicial Models of Identity Types
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
Benno van den Berg, Richard Garner
MKM
2007
Springer
14 years 1 months ago
Biform Theories in Chiron
An axiomatic theory represents mathematical knowledge declaratively as a set of axioms. An algorithmic theory represents mathematical knowledge procedurally as a set of algorithms....
William M. Farmer
CP
2009
Springer
14 years 8 months ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...
JUCS
2008
134views more  JUCS 2008»
13 years 7 months ago
A Tool for Reasoning about Qualitative Temporal Information: the Theory of S-languages with a Lisp Implementation
: Reasoning about incomplete qualitative temporal information is an essential topic in many artificial intelligence and natural language processing applications. In the domain of n...
Irène Durand, Sylviane R. Schwer
ENTCS
2008
137views more  ENTCS 2008»
13 years 7 months ago
Computerizing Mathematical Text with MathLang
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
Fairouz Kamareddine, J. B. Wells