Notes on complex combinators and structurally-free theorem proving (1996)
- Autor:
- Autor USP: FINGER, MARCELO - IME
- Unidade: IME
- Assunto: LÓGICA MATEMÁTICA
- Language: Inglês
- Imprenta:
-
ABNT
FINGER, Marcelo. Notes on complex combinators and structurally-free theorem proving. . São Paulo: IME-USP. . Acesso em: 21 jan. 2026. , 1996 -
APA
Finger, M. (1996). Notes on complex combinators and structurally-free theorem proving. São Paulo: IME-USP. -
NLM
Finger M. Notes on complex combinators and structurally-free theorem proving. 1996 ;[citado 2026 jan. 21 ] -
Vancouver
Finger M. Notes on complex combinators and structurally-free theorem proving. 1996 ;[citado 2026 jan. 21 ] - On the predictability of classical propositional logic
- A logical reconstruction of temporal databases
- Resource use pattern analysis for predicting resource availability in opportunistic grids
- Projeto de dados em bancos de dados distribuidos
- Tagging a morphologically Rich language: the construction of the Tycho Brahe parsed corpus of historical portuguese
- Parsing natural language using LDS: a prototype
- Equal rights for the cut: computable non-analytic cuts in cut-based proofs
- Combinações de lógicas modais não-normais
- Two-dimensional executable temporal logic for bitemporal databases
- Sharing resource-sensitive knowledge using combinator logics
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
