We study finite first-order satisfiability (FSAT) in the constructive setting of dependent type theory. Employing synthetic accounts of enumerability and decidability. we give a full classification of FSAT depending on the first-order signature of non-logical symbols. On the one hand. https://yeswellneses.shop/product-category/vegan-supplements/