Symbolic Languages and Ars Combinatoria

TL;DR

This paper examines Leibniz's 1666 work on the syntax of formal languages with primitive terms, proposing a new generalized formulation of his combinatorial logic.

Contribution

It introduces a novel formalization that extends Leibniz's original conception of symbolic languages and combinatorial systems.

Findings

Provides a new mathematical formulation of Leibniz's ideas

Generalizes the syntax of formal languages with primitive terms

Enhances understanding of combinatorial logic systems

Abstract

This article analyses some paragraphs of the Dissertatio de Arte Combinatoria (1666) where G.W. Leibniz considers the syntax of a language with a given number of primitive terms. We propose a new formulation which generalizes the philosopher conception of such a formal system.