Axiomatizing truth in a finite model

Given a nite model, we build an axiomatic theory such that the propositions provable in this theory are those valid in the model. We sketch applications to automated theorem proving.

Data and Resources

Additional Info

Field Value
Source https://inria.hal.science/hal-00919469
Author Dowek, Gilles, Jiang, Ying
Maintainer CCSD
Last Updated May 7, 2026, 18:59 (UTC)
Created May 7, 2026, 18:59 (UTC)
Identifier hal-00919469
Language en
Rights https://about.hal.science/hal-authorisation-v1/
contributor Deduction modulo, interopérabilité et démonstration automatique (DEDUCTEAM) ; Inria Paris-Rocquencourt ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
creator Dowek, Gilles
date 2014-01-17T00:00:00
harvest_object_id 89cc6424-0f8e-4e97-aefa-432f84de5a53
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-02-26T00:00:00
set_spec type:UNDEFINED