AI Chat AI Image Generator AI Video Text to Speech

A Topological Application of Labelled Natural Deduction

06/19/2019

∙

by Tiago M. L. Veras, et al.

∙

∙

We use a labelled deduction system based on the concept of computational paths (sequences of rewrites) as equalities between two terms of the same type. We also define a term rewriting system that is used to make computations between these computational paths, establishing equalities between equalities. We then proceed to show the main result here: using this system to obtain the calculation of the fundamental group of the circle, of the torus and the real projective plane.

Tiago M. L. Veras
3 publications
Arthur F. Ramos
5 publications
Ruy J. G. B. de Queiroz
11 publications
Anjolina G. de Oliveira
6 publications

research

∙ 06/19/2019

An alternative approach to the calculation of fundamental groups based on labeled natural deduction

In this work, we use a labelled deduction system based on the concept of...

0 Tiago M. L. de Veras, et al. ∙

research

∙ 07/13/2020

Computational Paths – A Weak Groupoid

We use a labelled deduction system based on the concept of computational...

0 Tiago M. L. Veras, et al. ∙

research

∙ 04/03/2018

On the Calculation of Fundamental Groups in Homotopy Type Theory by Means of Computational Paths

One of the most interesting entities of homotopy type theory is the iden...

0 Tiago Mendonça Lucena de Veras, et al. ∙

research

∙ 03/02/2018

On the Use of Computational Paths in Path Spaces of Homotopy Type Theory

The treatment of equality as a type in type theory gives rise to an inte...

0 Arthur F. Ramos, et al. ∙

research

∙ 04/16/2020

Compatible Paths on Labelled Point Sets

Let P and Q be finite point sets of the same cardinality in ℝ^2, each la...

0 Elena Arseneva, et al. ∙

research

∙ 10/08/2021

Walking into the complex plane to 'order' better time integrators

Most numerical methods for time integration use real time steps. Complex...

0 Jithin D. George, et al. ∙